/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/loops-crafted-1/sum_natnum.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:06:32,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:06:32,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:06:32,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:06:32,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:06:32,632 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:06:32,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:06:32,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:06:32,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:06:32,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:06:32,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:06:32,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:06:32,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:06:32,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:06:32,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:06:32,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:06:32,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:06:32,653 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:06:32,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:06:32,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:06:32,663 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:06:32,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:06:32,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:06:32,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:06:32,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:06:32,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:06:32,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:06:32,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:06:32,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:06:32,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:06:32,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:06:32,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:06:32,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:06:32,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:06:32,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:06:32,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:06:32,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:06:32,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:06:32,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:06:32,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:06:32,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:06:32,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:06:32,684 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:06:32,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:06:32,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:06:32,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:06:32,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:06:32,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:06:32,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:06:32,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:06:32,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:06:32,700 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:06:32,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:06:32,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:06:32,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:06:32,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:06:32,701 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:06:32,701 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:06:32,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:06:32,701 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:06:32,701 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:06:32,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:06:32,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:06:32,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:06:32,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:06:32,951 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:06:32,952 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-15 13:06:33,005 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207e79c1/77a11b92b3f046208eb7aa66f403e11e/FLAG202951e22 [2022-04-15 13:06:33,339 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:06:33,340 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c [2022-04-15 13:06:33,344 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207e79c1/77a11b92b3f046208eb7aa66f403e11e/FLAG202951e22 [2022-04-15 13:06:33,762 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e207e79c1/77a11b92b3f046208eb7aa66f403e11e [2022-04-15 13:06:33,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:06:33,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:06:33,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:06:33,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:06:33,773 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:06:33,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:33,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4935b61c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33, skipping insertion in model container [2022-04-15 13:06:33,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:33,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:06:33,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:06:33,930 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-15 13:06:33,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:06:33,949 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:06:33,959 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sum_natnum.c[458,471] [2022-04-15 13:06:33,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:06:33,975 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:06:33,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33 WrapperNode [2022-04-15 13:06:33,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:06:33,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:06:33,976 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:06:33,976 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:06:33,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:33,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:33,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:33,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:34,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:34,011 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:34,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:34,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:06:34,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:06:34,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:06:34,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:06:34,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (1/1) ... [2022-04-15 13:06:34,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:06:34,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:34,061 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:06:34,086 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:06:34,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:06:34,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:06:34,109 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:06:34,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:06:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:06:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:06:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:06:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:06:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:06:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:06:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:06:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:06:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:06:34,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:06:34,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:06:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:06:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:06:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:06:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:06:34,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:06:34,172 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:06:34,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:06:34,302 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:06:34,309 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:06:34,309 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:06:34,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:06:34 BoogieIcfgContainer [2022-04-15 13:06:34,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:06:34,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:06:34,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:06:34,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:06:34,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:06:33" (1/3) ... [2022-04-15 13:06:34,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137600c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:06:34, skipping insertion in model container [2022-04-15 13:06:34,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:06:33" (2/3) ... [2022-04-15 13:06:34,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137600c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:06:34, skipping insertion in model container [2022-04-15 13:06:34,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:06:34" (3/3) ... [2022-04-15 13:06:34,321 INFO L111 eAbstractionObserver]: Analyzing ICFG sum_natnum.c [2022-04-15 13:06:34,326 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:06:34,326 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:06:34,367 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:06:34,372 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:06:34,372 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:06:34,389 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:06:34,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 13:06:34,397 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:34,397 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:34,398 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:34,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:34,404 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 1 times [2022-04-15 13:06:34,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:34,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1507630070] [2022-04-15 13:06:34,418 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:06:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash -407588949, now seen corresponding path program 2 times [2022-04-15 13:06:34,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:34,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647672267] [2022-04-15 13:06:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:34,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:06:34,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26038392] [2022-04-15 13:06:34,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:06:34,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:34,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:34,504 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:06:34,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:06:34,593 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:06:34,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:06:34,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 13:06:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:34,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:34,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2022-04-15 13:06:34,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#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);~SIZE~0 := 40000; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:34,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {30#(<= 40000 ~SIZE~0)} assume true; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:34,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30#(<= 40000 ~SIZE~0)} {22#true} #45#return; {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:34,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {30#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:34,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:34,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} assume !(~i~0 < ~SIZE~0); {23#false} is VALID [2022-04-15 13:06:34,893 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {23#false} is VALID [2022-04-15 13:06:34,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-15 13:06:34,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-15 13:06:34,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-15 13:06:34,894 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:06:34,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:06:34,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:34,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647672267] [2022-04-15 13:06:34,896 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:06:34,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26038392] [2022-04-15 13:06:34,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26038392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:34,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:34,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:34,899 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:34,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1507630070] [2022-04-15 13:06:34,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1507630070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:34,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:34,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:34,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164635364] [2022-04-15 13:06:34,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:06:34,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:34,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:34,938 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:06:34,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:06:34,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:34,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:06:34,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:06:34,970 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:41,792 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 13:06:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:06:41,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 13:06:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 13:06:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-04-15 13:06:41,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-04-15 13:06:41,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:41,869 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:06:41,869 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 13:06:41,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:06:41,875 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:41,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:06:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 13:06:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-15 13:06:41,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:41,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,952 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,952 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:41,955 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 13:06:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 13:06:41,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:41,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:41,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 13:06:41,957 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 13:06:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:41,959 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 13:06:41,960 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 13:06:41,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:41,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:41,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:41,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:41,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-15 13:06:41,980 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-15 13:06:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:41,981 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-15 13:06:41,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:41,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-15 13:06:42,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:42,006 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 13:06:42,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:06:42,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:42,012 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:42,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 13:06:42,212 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 13:06:42,213 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:42,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 284139538, now seen corresponding path program 1 times [2022-04-15 13:06:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:42,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [643532206] [2022-04-15 13:06:42,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1171643219, now seen corresponding path program 1 times [2022-04-15 13:06:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:42,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940577516] [2022-04-15 13:06:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:42,702 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:06:42,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [735950438] [2022-04-15 13:06:42,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:42,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:42,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:42,704 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:06:42,714 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:06:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:42,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:06:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:42,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:42,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {174#true} is VALID [2022-04-15 13:06:42,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#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);~SIZE~0 := 40000; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:42,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#(<= 40000 ~SIZE~0)} assume true; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:42,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {182#(<= 40000 ~SIZE~0)} {174#true} #45#return; {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:42,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {182#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {182#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:42,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:42,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [49] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= v_main_~sum~0_In_1 v_main_~sum~0_Out_2) (= v_~SIZE~0_In_1 v_~SIZE~0_In_1) .cse0) (and (= v_main_~i~0_Out_2 0) .cse0 (<= v_main_~sum~0_In_1 v_main_~sum~0_Out_2) (< v_main_~i~0_Out_2 (+ v_~SIZE~0_In_1 1))))) InVars {~SIZE~0=v_~SIZE~0_In_1, main_~i~0=v_main_~i~0_In_1, main_~sum~0=v_main_~sum~0_In_1} OutVars{~SIZE~0=v_~SIZE~0_In_1, main_~i~0=v_main_~i~0_Out_2, main_~sum~0=v_main_~sum~0_Out_2} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:42,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [48] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {175#false} is VALID [2022-04-15 13:06:42,894 INFO L272 TraceCheckUtils]: 8: Hoare triple {175#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {175#false} is VALID [2022-04-15 13:06:42,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {175#false} ~cond := #in~cond; {175#false} is VALID [2022-04-15 13:06:42,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {175#false} assume 0 == ~cond; {175#false} is VALID [2022-04-15 13:06:42,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2022-04-15 13:06:42,896 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:06:42,897 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:06:42,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940577516] [2022-04-15 13:06:42,897 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:06:42,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735950438] [2022-04-15 13:06:42,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735950438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:42,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:42,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:42,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:42,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [643532206] [2022-04-15 13:06:42,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [643532206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:42,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:42,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:06:42,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113431216] [2022-04-15 13:06:42,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:42,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:06:42,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:42,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:42,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:42,973 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:06:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:06:42,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:06:42,975 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:45,156 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:06:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:06:45,156 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:06:45,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 13:06:45,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-15 13:06:45,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-15 13:06:45,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:45,183 INFO L225 Difference]: With dead ends: 19 [2022-04-15 13:06:45,183 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:06:45,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:06:45,184 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:45,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:45,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:06:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:06:45,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:45,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,210 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,210 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:45,212 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:06:45,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:06:45,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:45,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:45,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:06:45,213 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:06:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:45,214 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-15 13:06:45,214 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:06:45,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:45,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:45,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:45,215 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-15 13:06:45,217 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-15 13:06:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:45,217 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-15 13:06:45,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-15 13:06:45,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:45,245 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-15 13:06:45,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 13:06:45,246 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:45,246 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:45,307 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:06:45,446 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,SelfDestructingSolverStorable1 [2022-04-15 13:06:45,447 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:45,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash 252886155, now seen corresponding path program 2 times [2022-04-15 13:06:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:45,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1559016474] [2022-04-15 13:06:45,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:45,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1230748563, now seen corresponding path program 1 times [2022-04-15 13:06:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:45,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286099649] [2022-04-15 13:06:45,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:45,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:45,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:06:45,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403389194] [2022-04-15 13:06:45,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:45,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:45,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:45,752 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:06:45,774 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:06:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:45,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:06:45,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:45,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:45,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {308#true} call ULTIMATE.init(); {308#true} is VALID [2022-04-15 13:06:45,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {308#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);~SIZE~0 := 40000; {316#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:45,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#(<= 40000 ~SIZE~0)} assume true; {316#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:45,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#(<= 40000 ~SIZE~0)} {308#true} #45#return; {316#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:45,899 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {316#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:45,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {329#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:45,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {329#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [51] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_2 v_main_~i~0_Out_4))) (or (and (<= v_main_~sum~0_In_2 v_main_~sum~0_Out_4) (< v_main_~i~0_Out_4 (+ v_~SIZE~0_In_2 1)) (= v_main_~i~0_Out_4 0) .cse0) (and (= v_main_~sum~0_In_2 v_main_~sum~0_Out_4) (= v_~SIZE~0_In_2 v_~SIZE~0_In_2) .cse0))) InVars {~SIZE~0=v_~SIZE~0_In_2, main_~i~0=v_main_~i~0_In_2, main_~sum~0=v_main_~sum~0_In_2} OutVars{~SIZE~0=v_~SIZE~0_In_2, main_~i~0=v_main_~i~0_Out_4, main_~sum~0=v_main_~sum~0_Out_4} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {329#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:45,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [50] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {309#false} is VALID [2022-04-15 13:06:45,901 INFO L272 TraceCheckUtils]: 8: Hoare triple {309#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {309#false} is VALID [2022-04-15 13:06:45,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#false} ~cond := #in~cond; {309#false} is VALID [2022-04-15 13:06:45,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#false} assume 0 == ~cond; {309#false} is VALID [2022-04-15 13:06:45,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {309#false} assume !false; {309#false} is VALID [2022-04-15 13:06:45,902 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:06:45,902 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:06:45,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:45,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286099649] [2022-04-15 13:06:45,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:06:45,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403389194] [2022-04-15 13:06:45,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403389194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:45,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:45,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:45,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:45,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1559016474] [2022-04-15 13:06:45,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1559016474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:45,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:45,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:06:45,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695147449] [2022-04-15 13:06:45,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:45,992 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:06:45,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:45,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:46,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:46,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:06:46,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:46,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:06:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:06:46,007 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:48,171 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:06:48,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:06:48,171 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-15 13:06:48,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:48,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 13:06:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-15 13:06:48,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-15 13:06:48,194 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:06:48,196 INFO L225 Difference]: With dead ends: 20 [2022-04-15 13:06:48,196 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 13:06:48,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:06:48,197 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:48,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:06:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 13:06:48,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 13:06:48,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:48,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,210 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,210 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:48,211 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:06:48,212 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:06:48,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:48,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:48,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:06:48,212 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-15 13:06:48,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:48,213 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-15 13:06:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:06:48,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:48,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:48,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:48,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:48,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 13:06:48,215 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-15 13:06:48,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:48,215 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 13:06:48,216 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 13:06:48,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 13:06:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:06:48,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:48,231 INFO L499 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:48,256 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:06:48,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:48,449 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:48,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:48,450 INFO L85 PathProgramCache]: Analyzing trace with hash -715968718, now seen corresponding path program 3 times [2022-04-15 13:06:48,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:48,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175411414] [2022-04-15 13:06:48,658 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1289853907, now seen corresponding path program 1 times [2022-04-15 13:06:48,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:48,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111039136] [2022-04-15 13:06:48,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:48,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:48,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:06:48,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1669798025] [2022-04-15 13:06:48,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:48,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:48,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:48,673 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:06:48,695 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:06:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:48,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:06:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:48,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:48,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {449#true} call ULTIMATE.init(); {449#true} is VALID [2022-04-15 13:06:48,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {449#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);~SIZE~0 := 40000; {457#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:48,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#(<= 40000 ~SIZE~0)} assume true; {457#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:48,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#(<= 40000 ~SIZE~0)} {449#true} #45#return; {457#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:48,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {457#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:48,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {470#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:48,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [53] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_3 v_main_~i~0_Out_6))) (or (and (= v_~SIZE~0_In_3 v_~SIZE~0_In_3) (= v_main_~sum~0_In_3 v_main_~sum~0_Out_6) .cse0) (and (<= v_main_~sum~0_In_3 v_main_~sum~0_Out_6) (< v_main_~i~0_Out_6 (+ v_~SIZE~0_In_3 1)) (= v_main_~i~0_Out_6 0) .cse0))) InVars {~SIZE~0=v_~SIZE~0_In_3, main_~i~0=v_main_~i~0_In_3, main_~sum~0=v_main_~sum~0_In_3} OutVars{~SIZE~0=v_~SIZE~0_In_3, main_~i~0=v_main_~i~0_Out_6, main_~sum~0=v_main_~sum~0_Out_6} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {470#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:48,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {470#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [52] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {450#false} is VALID [2022-04-15 13:06:48,832 INFO L272 TraceCheckUtils]: 8: Hoare triple {450#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {450#false} is VALID [2022-04-15 13:06:48,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#false} ~cond := #in~cond; {450#false} is VALID [2022-04-15 13:06:48,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#false} assume 0 == ~cond; {450#false} is VALID [2022-04-15 13:06:48,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#false} assume !false; {450#false} is VALID [2022-04-15 13:06:48,833 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:06:48,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:06:48,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111039136] [2022-04-15 13:06:48,834 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:06:48,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669798025] [2022-04-15 13:06:48,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669798025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:48,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:48,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:48,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:48,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175411414] [2022-04-15 13:06:48,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175411414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:48,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:48,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:06:48,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416144721] [2022-04-15 13:06:48,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:48,929 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:06:48,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:48,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:48,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:48,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 13:06:48,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:48,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 13:06:48,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:06:48,959 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,101 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:06:53,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:06:53,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:06:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:53,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 13:06:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-15 13:06:53,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-15 13:06:53,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:53,122 INFO L225 Difference]: With dead ends: 21 [2022-04-15 13:06:53,122 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:06:53,122 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-04-15 13:06:53,123 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:53,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:06:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:06:53,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 13:06:53,138 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:53,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,139 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,139 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,140 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 13:06:53,140 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:06:53,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:53,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:53,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:06:53,141 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:06:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:53,142 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 13:06:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:06:53,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:53,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:53,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:53,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:53,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-15 13:06:53,143 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-15 13:06:53,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:53,144 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-15 13:06:53,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-15 13:06:53,157 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:06:53,158 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 13:06:53,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:06:53,158 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:53,158 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:53,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 13:06:53,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:53,363 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:53,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:53,364 INFO L85 PathProgramCache]: Analyzing trace with hash -685698709, now seen corresponding path program 4 times [2022-04-15 13:06:53,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:53,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1756583119] [2022-04-15 13:06:53,582 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:06:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1348959251, now seen corresponding path program 1 times [2022-04-15 13:06:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:06:53,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938397463] [2022-04-15 13:06:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:06:53,595 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:06:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [92511974] [2022-04-15 13:06:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:06:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:06:53,597 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:06:53,606 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:06:53,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:53,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:06:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:06:53,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:53,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {597#true} call ULTIMATE.init(); {597#true} is VALID [2022-04-15 13:06:53,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#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);~SIZE~0 := 40000; {605#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:53,730 INFO L290 TraceCheckUtils]: 2: Hoare triple {605#(<= 40000 ~SIZE~0)} assume true; {605#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:53,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {605#(<= 40000 ~SIZE~0)} {597#true} #45#return; {605#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:53,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {605#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {605#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:06:53,732 INFO L290 TraceCheckUtils]: 5: Hoare triple {605#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {618#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:53,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [55] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_4 v_main_~i~0_Out_8))) (or (and .cse0 (= v_main_~sum~0_In_4 v_main_~sum~0_Out_8) (= v_~SIZE~0_In_4 v_~SIZE~0_In_4)) (and (<= v_main_~sum~0_In_4 v_main_~sum~0_Out_8) (= v_main_~i~0_Out_8 0) .cse0 (< v_main_~i~0_Out_8 (+ v_~SIZE~0_In_4 1))))) InVars {~SIZE~0=v_~SIZE~0_In_4, main_~i~0=v_main_~i~0_In_4, main_~sum~0=v_main_~sum~0_In_4} OutVars{~SIZE~0=v_~SIZE~0_In_4, main_~i~0=v_main_~i~0_Out_8, main_~sum~0=v_main_~sum~0_Out_8} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {618#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:06:53,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [54] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {598#false} is VALID [2022-04-15 13:06:53,733 INFO L272 TraceCheckUtils]: 8: Hoare triple {598#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {598#false} is VALID [2022-04-15 13:06:53,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {598#false} ~cond := #in~cond; {598#false} is VALID [2022-04-15 13:06:53,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#false} assume 0 == ~cond; {598#false} is VALID [2022-04-15 13:06:53,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#false} assume !false; {598#false} is VALID [2022-04-15 13:06:53,736 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:06:53,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:06:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:06:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938397463] [2022-04-15 13:06:53,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:06:53,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92511974] [2022-04-15 13:06:53,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [92511974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:53,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:53,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:06:53,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:53,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1756583119] [2022-04-15 13:06:53,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1756583119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:53,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:53,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 13:06:53,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516843258] [2022-04-15 13:06:53,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:53,857 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:06:53,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:53,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:53,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:53,873 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 13:06:53,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:53,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 13:06:53,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:06:53,874 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:59,945 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:06:59,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 13:06:59,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:06:59,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:59,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 13:06:59,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 13:06:59,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 13:06:59,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:59,972 INFO L225 Difference]: With dead ends: 22 [2022-04-15 13:06:59,972 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 13:06:59,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-04-15 13:06:59,973 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:59,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:06:59,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 13:06:59,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 13:06:59,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:59,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,986 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,986 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:59,987 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:06:59,987 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:06:59,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:59,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:59,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:06:59,988 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 13:06:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:59,989 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 13:06:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:06:59,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:59,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:59,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:59,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 13:06:59,991 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-15 13:06:59,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:59,991 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 13:06:59,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:59,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 13:07:00,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 13:07:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:07:00,008 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:00,008 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:00,026 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:07:00,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:00,216 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 252671570, now seen corresponding path program 5 times [2022-04-15 13:07:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1442452037] [2022-04-15 13:07:00,458 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1408064595, now seen corresponding path program 1 times [2022-04-15 13:07:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:00,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564368690] [2022-04-15 13:07:00,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:00,470 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:00,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [938128370] [2022-04-15 13:07:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:00,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:00,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:00,476 INFO L229 MonitoredProcess]: Starting monitored process 7 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:07:00,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:07:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:00,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:00,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:00,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {752#true} call ULTIMATE.init(); {752#true} is VALID [2022-04-15 13:07:00,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {752#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);~SIZE~0 := 40000; {760#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#(<= 40000 ~SIZE~0)} assume true; {760#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:00,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#(<= 40000 ~SIZE~0)} {752#true} #45#return; {760#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:00,623 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {760#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:00,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {773#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:00,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [57] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_5 v_main_~i~0_Out_10))) (or (and (= v_~SIZE~0_In_5 v_~SIZE~0_In_5) (= v_main_~sum~0_In_5 v_main_~sum~0_Out_10) .cse0) (and (= v_main_~i~0_Out_10 0) (<= v_main_~sum~0_In_5 v_main_~sum~0_Out_10) .cse0 (< v_main_~i~0_Out_10 (+ v_~SIZE~0_In_5 1))))) InVars {~SIZE~0=v_~SIZE~0_In_5, main_~i~0=v_main_~i~0_In_5, main_~sum~0=v_main_~sum~0_In_5} OutVars{~SIZE~0=v_~SIZE~0_In_5, main_~i~0=v_main_~i~0_Out_10, main_~sum~0=v_main_~sum~0_Out_10} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {773#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:00,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [56] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {753#false} is VALID [2022-04-15 13:07:00,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {753#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {753#false} is VALID [2022-04-15 13:07:00,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {753#false} ~cond := #in~cond; {753#false} is VALID [2022-04-15 13:07:00,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {753#false} assume 0 == ~cond; {753#false} is VALID [2022-04-15 13:07:00,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {753#false} assume !false; {753#false} is VALID [2022-04-15 13:07:00,626 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:07:00,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564368690] [2022-04-15 13:07:00,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:00,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938128370] [2022-04-15 13:07:00,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938128370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:00,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:00,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:00,813 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:00,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1442452037] [2022-04-15 13:07:00,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1442452037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:00,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:00,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:07:00,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144026088] [2022-04-15 13:07:00,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:00,815 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:07:00,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:00,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:00,830 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:07:00,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:07:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:00,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:07:00,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:07:00,831 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:05,370 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:07:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:07:05,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 13:07:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:05,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 13:07:05,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-15 13:07:05,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-15 13:07:05,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:05,393 INFO L225 Difference]: With dead ends: 23 [2022-04-15 13:07:05,393 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 13:07:05,393 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:07:05,394 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:05,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:07:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 13:07:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 13:07:05,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:05,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,410 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,410 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:05,411 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:07:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:07:05,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:05,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:05,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:07:05,412 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 13:07:05,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:05,413 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-15 13:07:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:07:05,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:05,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:05,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:05,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-15 13:07:05,415 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-15 13:07:05,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:05,415 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-15 13:07:05,415 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:05,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-15 13:07:05,436 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:07:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-15 13:07:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:07:05,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:05,438 INFO L499 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:05,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:05,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:05,639 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash -722620853, now seen corresponding path program 6 times [2022-04-15 13:07:05,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:05,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482234498] [2022-04-15 13:07:05,861 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:05,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1467169939, now seen corresponding path program 1 times [2022-04-15 13:07:05,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:05,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062878919] [2022-04-15 13:07:05,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:05,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:05,874 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:05,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [99175470] [2022-04-15 13:07:05,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:05,876 INFO L229 MonitoredProcess]: Starting monitored process 8 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:07:05,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:07:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:05,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:05,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:06,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {914#true} call ULTIMATE.init(); {914#true} is VALID [2022-04-15 13:07:06,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {914#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);~SIZE~0 := 40000; {922#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:06,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#(<= 40000 ~SIZE~0)} assume true; {922#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:06,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#(<= 40000 ~SIZE~0)} {914#true} #45#return; {922#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:06,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {922#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:06,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {935#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:06,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {935#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [59] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_6 v_main_~i~0_Out_12))) (or (and .cse0 (< v_main_~i~0_Out_12 (+ v_~SIZE~0_In_6 1)) (<= v_main_~sum~0_In_6 v_main_~sum~0_Out_12) (= v_main_~i~0_Out_12 0)) (and .cse0 (= v_main_~sum~0_In_6 v_main_~sum~0_Out_12) (= v_~SIZE~0_In_6 v_~SIZE~0_In_6)))) InVars {~SIZE~0=v_~SIZE~0_In_6, main_~i~0=v_main_~i~0_In_6, main_~sum~0=v_main_~sum~0_In_6} OutVars{~SIZE~0=v_~SIZE~0_In_6, main_~i~0=v_main_~i~0_Out_12, main_~sum~0=v_main_~sum~0_Out_12} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {935#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:06,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {935#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [58] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {915#false} is VALID [2022-04-15 13:07:06,038 INFO L272 TraceCheckUtils]: 8: Hoare triple {915#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {915#false} is VALID [2022-04-15 13:07:06,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {915#false} ~cond := #in~cond; {915#false} is VALID [2022-04-15 13:07:06,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {915#false} assume 0 == ~cond; {915#false} is VALID [2022-04-15 13:07:06,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {915#false} assume !false; {915#false} is VALID [2022-04-15 13:07:06,039 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:07:06,039 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062878919] [2022-04-15 13:07:06,039 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:06,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99175470] [2022-04-15 13:07:06,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99175470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:06,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:06,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:06,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482234498] [2022-04-15 13:07:06,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482234498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:06,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:06,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:07:06,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338626773] [2022-04-15 13:07:06,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:07:06,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:06,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:06,249 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:06,250 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:07:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:06,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:07:06,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:07:06,251 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:09,720 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:07:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 13:07:09,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 13:07:09,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:09,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 13:07:09,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-15 13:07:09,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-15 13:07:09,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:09,746 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:07:09,746 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:07:09,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:07:09,747 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:09,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:07:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:07:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:07:09,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:09,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,764 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,764 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:09,765 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:07:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:07:09,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:09,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:09,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:07:09,766 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 13:07:09,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:09,767 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 13:07:09,767 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:07:09,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:09,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:09,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:09,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:09,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 13:07:09,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-15 13:07:09,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:09,768 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 13:07:09,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:09,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 13:07:09,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 13:07:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:07:09,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:09,806 INFO L499 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:09,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:10,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:10,016 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash -891914894, now seen corresponding path program 7 times [2022-04-15 13:07:10,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:10,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [683066133] [2022-04-15 13:07:10,214 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1526275283, now seen corresponding path program 1 times [2022-04-15 13:07:10,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:10,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103341593] [2022-04-15 13:07:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:10,226 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:10,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1016802700] [2022-04-15 13:07:10,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:10,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:10,228 INFO L229 MonitoredProcess]: Starting monitored process 9 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:07:10,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:07:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:10,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:10,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:10,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {1083#true} call ULTIMATE.init(); {1083#true} is VALID [2022-04-15 13:07:10,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1083#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);~SIZE~0 := 40000; {1091#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:10,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {1091#(<= 40000 ~SIZE~0)} assume true; {1091#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:10,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1091#(<= 40000 ~SIZE~0)} {1083#true} #45#return; {1091#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:10,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {1091#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1091#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:10,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {1091#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1104#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:10,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {1104#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [61] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_7 v_main_~i~0_Out_14))) (or (and (= v_main_~sum~0_In_7 v_main_~sum~0_Out_14) .cse0 (= v_~SIZE~0_In_7 v_~SIZE~0_In_7)) (and (= v_main_~i~0_Out_14 0) (< v_main_~i~0_Out_14 (+ v_~SIZE~0_In_7 1)) .cse0 (<= v_main_~sum~0_In_7 v_main_~sum~0_Out_14)))) InVars {~SIZE~0=v_~SIZE~0_In_7, main_~i~0=v_main_~i~0_In_7, main_~sum~0=v_main_~sum~0_In_7} OutVars{~SIZE~0=v_~SIZE~0_In_7, main_~i~0=v_main_~i~0_Out_14, main_~sum~0=v_main_~sum~0_Out_14} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {1104#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:10,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {1104#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [60] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1084#false} is VALID [2022-04-15 13:07:10,363 INFO L272 TraceCheckUtils]: 8: Hoare triple {1084#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1084#false} is VALID [2022-04-15 13:07:10,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {1084#false} ~cond := #in~cond; {1084#false} is VALID [2022-04-15 13:07:10,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {1084#false} assume 0 == ~cond; {1084#false} is VALID [2022-04-15 13:07:10,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {1084#false} assume !false; {1084#false} is VALID [2022-04-15 13:07:10,364 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:07:10,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:10,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103341593] [2022-04-15 13:07:10,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:10,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016802700] [2022-04-15 13:07:10,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016802700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:10,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:10,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:10,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:10,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [683066133] [2022-04-15 13:07:10,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [683066133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:10,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:10,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:07:10,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512204908] [2022-04-15 13:07:10,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:10,540 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:07:10,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:10,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:10,554 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:07:10,554 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:07:10,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:07:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:07:10,556 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,646 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:07:14,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:07:14,647 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:07:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 13:07:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-15 13:07:14,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-15 13:07:14,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:14,672 INFO L225 Difference]: With dead ends: 25 [2022-04-15 13:07:14,672 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:07:14,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-04-15 13:07:14,673 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:14,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:07:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:07:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:07:14,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:14,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,691 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,692 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,693 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:07:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:07:14,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:14,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:14,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:07:14,693 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:07:14,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:14,694 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-15 13:07:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:07:14,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:14,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:14,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:14,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:14,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-15 13:07:14,695 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-15 13:07:14,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:14,696 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-15 13:07:14,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:14,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-15 13:07:14,713 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:07:14,713 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-15 13:07:14,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:07:14,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:14,714 INFO L499 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:14,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:14,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-15 13:07:14,915 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:14,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:14,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1845062869, now seen corresponding path program 8 times [2022-04-15 13:07:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [5067677] [2022-04-15 13:07:15,112 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1585380627, now seen corresponding path program 1 times [2022-04-15 13:07:15,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:15,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001919369] [2022-04-15 13:07:15,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:15,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:15,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464374417] [2022-04-15 13:07:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:15,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:15,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:15,128 INFO L229 MonitoredProcess]: Starting monitored process 10 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:07:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:07:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:15,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:15,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:15,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {1259#true} call ULTIMATE.init(); {1259#true} is VALID [2022-04-15 13:07:15,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1259#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);~SIZE~0 := 40000; {1267#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:15,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1267#(<= 40000 ~SIZE~0)} assume true; {1267#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:15,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1267#(<= 40000 ~SIZE~0)} {1259#true} #45#return; {1267#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:15,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {1267#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1267#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:15,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1267#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1280#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:15,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [63] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_8 v_main_~i~0_Out_16))) (or (and (= v_main_~sum~0_In_8 v_main_~sum~0_Out_16) (= v_~SIZE~0_In_8 v_~SIZE~0_In_8) .cse0) (and (< v_main_~i~0_Out_16 (+ v_~SIZE~0_In_8 1)) (= v_main_~i~0_Out_16 0) .cse0 (<= v_main_~sum~0_In_8 v_main_~sum~0_Out_16)))) InVars {~SIZE~0=v_~SIZE~0_In_8, main_~i~0=v_main_~i~0_In_8, main_~sum~0=v_main_~sum~0_In_8} OutVars{~SIZE~0=v_~SIZE~0_In_8, main_~i~0=v_main_~i~0_Out_16, main_~sum~0=v_main_~sum~0_Out_16} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {1280#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:15,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [62] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1260#false} is VALID [2022-04-15 13:07:15,278 INFO L272 TraceCheckUtils]: 8: Hoare triple {1260#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1260#false} is VALID [2022-04-15 13:07:15,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#false} ~cond := #in~cond; {1260#false} is VALID [2022-04-15 13:07:15,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#false} assume 0 == ~cond; {1260#false} is VALID [2022-04-15 13:07:15,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#false} assume !false; {1260#false} is VALID [2022-04-15 13:07:15,278 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:07:15,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:15,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001919369] [2022-04-15 13:07:15,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:15,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464374417] [2022-04-15 13:07:15,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464374417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:15,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:15,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:15,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:15,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [5067677] [2022-04-15 13:07:15,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [5067677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:15,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:15,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:07:15,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403154968] [2022-04-15 13:07:15,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:15,506 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:07:15,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:15,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:15,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:15,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:07:15,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:15,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:07:15,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:07:15,524 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:23,638 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:07:23,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:07:23,638 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:07:23,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:23,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 13:07:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-15 13:07:23,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-15 13:07:23,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:23,668 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:07:23,668 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:07:23,669 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2022-04-15 13:07:23,669 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:23,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:07:23,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:07:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-15 13:07:23,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:23,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,687 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,687 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:23,688 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:07:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:07:23,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:23,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:23,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:07:23,688 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-15 13:07:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:23,689 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-15 13:07:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:07:23,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:23,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:23,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:23,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-15 13:07:23,691 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-15 13:07:23,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:23,691 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-15 13:07:23,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:23,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-15 13:07:23,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:23,713 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-15 13:07:23,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 13:07:23,713 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:23,713 INFO L499 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:23,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 13:07:23,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:23,931 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:23,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1327879022, now seen corresponding path program 9 times [2022-04-15 13:07:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:23,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836560598] [2022-04-15 13:07:24,115 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:24,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1644485971, now seen corresponding path program 1 times [2022-04-15 13:07:24,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:24,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638737219] [2022-04-15 13:07:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:24,126 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:24,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813694484] [2022-04-15 13:07:24,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:24,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:24,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:24,132 INFO L229 MonitoredProcess]: Starting monitored process 11 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:07:24,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:07:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:24,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:24,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:24,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {1442#true} call ULTIMATE.init(); {1442#true} is VALID [2022-04-15 13:07:24,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1442#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);~SIZE~0 := 40000; {1450#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:24,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {1450#(<= 40000 ~SIZE~0)} assume true; {1450#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:24,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1450#(<= 40000 ~SIZE~0)} {1442#true} #45#return; {1450#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:24,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1450#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1450#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:24,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1450#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1463#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:24,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {1463#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [65] L23-2-->L23-3_primed: Formula: (let ((.cse0 (= v_main_~i~0_In_9 v_main_~i~0_Out_18))) (or (and .cse0 (= v_~SIZE~0_In_9 v_~SIZE~0_In_9) (= v_main_~sum~0_In_9 v_main_~sum~0_Out_18)) (and .cse0 (<= v_main_~sum~0_In_9 v_main_~sum~0_Out_18) (= v_main_~i~0_Out_18 0) (< v_main_~i~0_Out_18 (+ v_~SIZE~0_In_9 1))))) InVars {~SIZE~0=v_~SIZE~0_In_9, main_~i~0=v_main_~i~0_In_9, main_~sum~0=v_main_~sum~0_In_9} OutVars{~SIZE~0=v_~SIZE~0_In_9, main_~i~0=v_main_~i~0_Out_18, main_~sum~0=v_main_~sum~0_Out_18} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {1463#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:24,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {1463#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [64] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1443#false} is VALID [2022-04-15 13:07:24,271 INFO L272 TraceCheckUtils]: 8: Hoare triple {1443#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1443#false} is VALID [2022-04-15 13:07:24,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1443#false} ~cond := #in~cond; {1443#false} is VALID [2022-04-15 13:07:24,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {1443#false} assume 0 == ~cond; {1443#false} is VALID [2022-04-15 13:07:24,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {1443#false} assume !false; {1443#false} is VALID [2022-04-15 13:07:24,271 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:07:24,271 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:24,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:24,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638737219] [2022-04-15 13:07:24,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:24,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813694484] [2022-04-15 13:07:24,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813694484] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:24,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:24,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:24,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:24,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836560598] [2022-04-15 13:07:24,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836560598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:24,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:24,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:07:24,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822830424] [2022-04-15 13:07:24,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:24,533 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:07:24,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:24,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:24,549 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:07:24,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 13:07:24,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 13:07:24,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:07:24,550 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,625 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:28,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:28,636 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:07:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 13:07:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 13:07:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 13:07:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-15 13:07:28,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-15 13:07:28,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:28,663 INFO L225 Difference]: With dead ends: 27 [2022-04-15 13:07:28,663 INFO L226 Difference]: Without dead ends: 22 [2022-04-15 13:07:28,664 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-04-15 13:07:28,664 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:28,664 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 13:07:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-15 13:07:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-15 13:07:28,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:28,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,694 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,695 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:28,696 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:07:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:07:28,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:28,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:28,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:07:28,696 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-15 13:07:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:28,697 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 13:07:28,697 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:07:28,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:28,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:28,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:28,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-15 13:07:28,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-15 13:07:28,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:28,698 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-15 13:07:28,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:28,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-15 13:07:28,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:28,724 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-15 13:07:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:07:28,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:28,724 INFO L499 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:28,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:28,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 13:07:28,925 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1819918347, now seen corresponding path program 10 times [2022-04-15 13:07:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:28,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589740461] [2022-04-15 13:07:29,136 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:29,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1703591315, now seen corresponding path program 1 times [2022-04-15 13:07:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:29,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045720706] [2022-04-15 13:07:29,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:29,146 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:29,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441058186] [2022-04-15 13:07:29,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:29,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:29,153 INFO L229 MonitoredProcess]: Starting monitored process 12 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:07:29,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:07:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:29,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:29,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:29,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {1632#true} call ULTIMATE.init(); {1632#true} is VALID [2022-04-15 13:07:29,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1632#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);~SIZE~0 := 40000; {1640#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:29,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {1640#(<= 40000 ~SIZE~0)} assume true; {1640#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:29,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1640#(<= 40000 ~SIZE~0)} {1632#true} #45#return; {1640#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:29,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {1640#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1640#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:29,299 INFO L290 TraceCheckUtils]: 5: Hoare triple {1640#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1653#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:29,300 INFO L290 TraceCheckUtils]: 6: Hoare triple {1653#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [67] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_20 v_main_~i~0_In_10) (< v_main_~i~0_Out_20 (+ v_~SIZE~0_In_10 1)) (<= v_main_~sum~0_In_10 v_main_~sum~0_Out_20) (= v_main_~i~0_Out_20 0)) (and (= v_~SIZE~0_In_10 v_~SIZE~0_In_10) (= v_main_~i~0_In_10 v_main_~i~0_Out_20) (= v_main_~sum~0_In_10 v_main_~sum~0_Out_20))) InVars {~SIZE~0=v_~SIZE~0_In_10, main_~i~0=v_main_~i~0_In_10, main_~sum~0=v_main_~sum~0_In_10} OutVars{~SIZE~0=v_~SIZE~0_In_10, main_~i~0=v_main_~i~0_Out_20, main_~sum~0=v_main_~sum~0_Out_20} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {1653#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:29,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {1653#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [66] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1633#false} is VALID [2022-04-15 13:07:29,301 INFO L272 TraceCheckUtils]: 8: Hoare triple {1633#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1633#false} is VALID [2022-04-15 13:07:29,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1633#false} ~cond := #in~cond; {1633#false} is VALID [2022-04-15 13:07:29,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {1633#false} assume 0 == ~cond; {1633#false} is VALID [2022-04-15 13:07:29,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {1633#false} assume !false; {1633#false} is VALID [2022-04-15 13:07:29,301 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:07:29,301 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:29,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:29,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045720706] [2022-04-15 13:07:29,302 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:29,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441058186] [2022-04-15 13:07:29,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441058186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:29,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:29,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:29,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:29,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589740461] [2022-04-15 13:07:29,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589740461] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:29,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:29,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 13:07:29,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010955286] [2022-04-15 13:07:29,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:29,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:07:29,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:29,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:29,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:07:29,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:07:29,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:07:29,574 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:29,750 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:07:29,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:07:29,751 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-15 13:07:29,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 13:07:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-15 13:07:29,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-15 13:07:29,779 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:07:29,780 INFO L225 Difference]: With dead ends: 28 [2022-04-15 13:07:29,780 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 13:07:29,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2022-04-15 13:07:29,781 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:29,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:07:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 13:07:29,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 13:07:29,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:29,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,804 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,804 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:29,805 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:07:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:07:29,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:29,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:29,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:07:29,806 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 13:07:29,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:29,806 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 13:07:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:07:29,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:29,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:29,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:29,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:29,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 13:07:29,808 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-15 13:07:29,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:29,808 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 13:07:29,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:29,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 13:07:29,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:29,829 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 13:07:29,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:07:29,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:29,830 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:29,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:30,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 13:07:30,036 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:30,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:30,036 INFO L85 PathProgramCache]: Analyzing trace with hash 617388978, now seen corresponding path program 11 times [2022-04-15 13:07:30,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:30,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [716907182] [2022-04-15 13:07:30,211 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:30,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1762696659, now seen corresponding path program 1 times [2022-04-15 13:07:30,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:30,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956911013] [2022-04-15 13:07:30,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:30,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:30,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:30,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446531495] [2022-04-15 13:07:30,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:30,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:30,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:30,224 INFO L229 MonitoredProcess]: Starting monitored process 13 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:07:30,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:07:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:30,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:07:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:30,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:30,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1829#true} call ULTIMATE.init(); {1829#true} is VALID [2022-04-15 13:07:30,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {1829#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);~SIZE~0 := 40000; {1837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:30,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(<= 40000 ~SIZE~0)} assume true; {1837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:30,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(<= 40000 ~SIZE~0)} {1829#true} #45#return; {1837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:30,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {1837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:30,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {1850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:07:30,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {1850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [69] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_11 v_main_~i~0_Out_22) (= v_main_~sum~0_In_11 v_main_~sum~0_Out_22) (= v_~SIZE~0_In_11 v_~SIZE~0_In_11)) (and (<= v_main_~sum~0_In_11 v_main_~sum~0_Out_22) (= v_main_~i~0_Out_22 v_main_~i~0_In_11) (= v_main_~i~0_Out_22 0) (< v_main_~i~0_Out_22 (+ v_~SIZE~0_In_11 1)))) InVars {~SIZE~0=v_~SIZE~0_In_11, main_~i~0=v_main_~i~0_In_11, main_~sum~0=v_main_~sum~0_In_11} OutVars{~SIZE~0=v_~SIZE~0_In_11, main_~i~0=v_main_~i~0_Out_22, main_~sum~0=v_main_~sum~0_Out_22} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {1850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:07:30,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [68] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {1830#false} is VALID [2022-04-15 13:07:30,347 INFO L272 TraceCheckUtils]: 8: Hoare triple {1830#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {1830#false} is VALID [2022-04-15 13:07:30,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {1830#false} ~cond := #in~cond; {1830#false} is VALID [2022-04-15 13:07:30,347 INFO L290 TraceCheckUtils]: 10: Hoare triple {1830#false} assume 0 == ~cond; {1830#false} is VALID [2022-04-15 13:07:30,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {1830#false} assume !false; {1830#false} is VALID [2022-04-15 13:07:30,347 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:07:30,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:30,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:30,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956911013] [2022-04-15 13:07:30,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:30,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446531495] [2022-04-15 13:07:30,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446531495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:30,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:30,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:30,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:30,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [716907182] [2022-04-15 13:07:30,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [716907182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:30,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:30,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 13:07:30,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138951816] [2022-04-15 13:07:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:07:30,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:30,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:30,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:30,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 13:07:30,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 13:07:30,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:07:30,585 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:35,064 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:41,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:43,449 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:45,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:47,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:49,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:51,464 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:53,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:07:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:53,486 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:07:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 13:07:53,486 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:07:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:53,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 13:07:53,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-15 13:07:53,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-15 13:07:53,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:53,514 INFO L225 Difference]: With dead ends: 29 [2022-04-15 13:07:53,514 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:07:53,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-15 13:07:53,515 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:53,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 62 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 8 Unknown, 0 Unchecked, 16.6s Time] [2022-04-15 13:07:53,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:07:53,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 13:07:53,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:53,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,536 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,536 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:53,537 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:07:53,537 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:07:53,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:53,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:53,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 13:07:53,537 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-15 13:07:53,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:53,538 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 13:07:53,538 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:07:53,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:53,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:53,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:53,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-15 13:07:53,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-15 13:07:53,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:53,539 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-15 13:07:53,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:53,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-15 13:07:53,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:53,559 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-15 13:07:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 13:07:53,559 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:53,559 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:53,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:53,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 13:07:53,763 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1993684203, now seen corresponding path program 12 times [2022-04-15 13:07:53,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:53,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [301609111] [2022-04-15 13:07:53,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:53,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1821802003, now seen corresponding path program 1 times [2022-04-15 13:07:53,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:53,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158921250] [2022-04-15 13:07:53,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:53,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:53,958 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:53,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [934553859] [2022-04-15 13:07:53,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:53,966 INFO L229 MonitoredProcess]: Starting monitored process 14 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:07:53,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:07:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:54,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:54,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:54,100 INFO L272 TraceCheckUtils]: 0: Hoare triple {2033#true} call ULTIMATE.init(); {2033#true} is VALID [2022-04-15 13:07:54,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#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);~SIZE~0 := 40000; {2041#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:54,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {2041#(<= 40000 ~SIZE~0)} assume true; {2041#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:54,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2041#(<= 40000 ~SIZE~0)} {2033#true} #45#return; {2041#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:54,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {2041#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2041#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:54,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {2041#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2054#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:54,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {2054#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [71] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_24 0) (<= v_main_~sum~0_In_12 v_main_~sum~0_Out_24) (= v_main_~i~0_Out_24 v_main_~i~0_In_12) (< v_main_~i~0_Out_24 (+ v_~SIZE~0_In_12 1))) (and (= v_main_~sum~0_In_12 v_main_~sum~0_Out_24) (= v_main_~i~0_In_12 v_main_~i~0_Out_24) (= v_~SIZE~0_In_12 v_~SIZE~0_In_12))) InVars {~SIZE~0=v_~SIZE~0_In_12, main_~i~0=v_main_~i~0_In_12, main_~sum~0=v_main_~sum~0_In_12} OutVars{~SIZE~0=v_~SIZE~0_In_12, main_~i~0=v_main_~i~0_Out_24, main_~sum~0=v_main_~sum~0_Out_24} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {2054#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:54,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2054#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [70] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2034#false} is VALID [2022-04-15 13:07:54,105 INFO L272 TraceCheckUtils]: 8: Hoare triple {2034#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2034#false} is VALID [2022-04-15 13:07:54,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {2034#false} ~cond := #in~cond; {2034#false} is VALID [2022-04-15 13:07:54,105 INFO L290 TraceCheckUtils]: 10: Hoare triple {2034#false} assume 0 == ~cond; {2034#false} is VALID [2022-04-15 13:07:54,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {2034#false} assume !false; {2034#false} is VALID [2022-04-15 13:07:54,105 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:07:54,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158921250] [2022-04-15 13:07:54,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:54,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934553859] [2022-04-15 13:07:54,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934553859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:54,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:54,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:54,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:54,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [301609111] [2022-04-15 13:07:54,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [301609111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:54,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:54,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:07:54,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480898511] [2022-04-15 13:07:54,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:54,432 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:07:54,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:54,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:54,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:54,447 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:07:54,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:54,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:07:54,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:07:54,448 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:56,637 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:07:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:07:56,637 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-15 13:07:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:07:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 13:07:56,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-15 13:07:56,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-15 13:07:56,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:56,665 INFO L225 Difference]: With dead ends: 30 [2022-04-15 13:07:56,665 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 13:07:56,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:07:56,666 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:07:56,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:07:56,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 13:07:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 13:07:56,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:07:56,690 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,690 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,690 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:56,691 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:07:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:07:56,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:56,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:56,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:07:56,692 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 13:07:56,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:07:56,692 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-15 13:07:56,692 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:07:56,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:07:56,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:07:56,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:07:56,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:07:56,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-15 13:07:56,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-15 13:07:56,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:07:56,693 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-15 13:07:56,694 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:56,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-15 13:07:56,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-15 13:07:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 13:07:56,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:07:56,718 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:07:56,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:07:56,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 13:07:56,938 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:07:56,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:07:56,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1709163218, now seen corresponding path program 13 times [2022-04-15 13:07:56,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:56,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1645736447] [2022-04-15 13:07:57,098 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:07:57,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1880907347, now seen corresponding path program 1 times [2022-04-15 13:07:57,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:57,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536449461] [2022-04-15 13:07:57,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:57,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:57,107 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:07:57,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242665481] [2022-04-15 13:07:57,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:57,108 INFO L229 MonitoredProcess]: Starting monitored process 15 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:07:57,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:07:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:57,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:07:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:57,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:57,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {2244#true} call ULTIMATE.init(); {2244#true} is VALID [2022-04-15 13:07:57,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {2244#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);~SIZE~0 := 40000; {2252#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:57,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {2252#(<= 40000 ~SIZE~0)} assume true; {2252#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:57,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2252#(<= 40000 ~SIZE~0)} {2244#true} #45#return; {2252#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:57,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {2252#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2252#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:07:57,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {2252#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2265#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:57,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {2265#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [73] L23-2-->L23-3_primed: Formula: (or (and (< v_main_~i~0_Out_26 (+ v_~SIZE~0_In_13 1)) (= v_main_~i~0_Out_26 0) (<= v_main_~sum~0_In_13 v_main_~sum~0_Out_26) (= v_main_~i~0_Out_26 v_main_~i~0_In_13)) (and (= v_main_~i~0_In_13 v_main_~i~0_Out_26) (= v_main_~sum~0_In_13 v_main_~sum~0_Out_26) (= v_~SIZE~0_In_13 v_~SIZE~0_In_13))) InVars {~SIZE~0=v_~SIZE~0_In_13, main_~i~0=v_main_~i~0_In_13, main_~sum~0=v_main_~sum~0_In_13} OutVars{~SIZE~0=v_~SIZE~0_In_13, main_~i~0=v_main_~i~0_Out_26, main_~sum~0=v_main_~sum~0_Out_26} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {2265#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:07:57,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {2265#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [72] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2245#false} is VALID [2022-04-15 13:07:57,208 INFO L272 TraceCheckUtils]: 8: Hoare triple {2245#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2245#false} is VALID [2022-04-15 13:07:57,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {2245#false} ~cond := #in~cond; {2245#false} is VALID [2022-04-15 13:07:57,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {2245#false} assume 0 == ~cond; {2245#false} is VALID [2022-04-15 13:07:57,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {2245#false} assume !false; {2245#false} is VALID [2022-04-15 13:07:57,209 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:07:57,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:07:57,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:57,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536449461] [2022-04-15 13:07:57,209 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:07:57,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242665481] [2022-04-15 13:07:57,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242665481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:57,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:57,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:07:57,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:07:57,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1645736447] [2022-04-15 13:07:57,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1645736447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:07:57,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:07:57,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 13:07:57,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438736521] [2022-04-15 13:07:57,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:07:57,551 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:07:57,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:07:57,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:07:57,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:07:57,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 13:07:57,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:07:57,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 13:07:57,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:07:57,568 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:01,794 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:08:01,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 13:08:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 13:08:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:01,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 13:08:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-15 13:08:01,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-15 13:08:01,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:01,823 INFO L225 Difference]: With dead ends: 31 [2022-04-15 13:08:01,823 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:08:01,823 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:08:01,824 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:01,824 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:08:01,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:08:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:08:01,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:01,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,849 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,849 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:01,850 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:08:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:08:01,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:01,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:01,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:08:01,851 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:08:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:01,851 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-15 13:08:01,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:08:01,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:01,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:01,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:01,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:01,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-15 13:08:01,852 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-15 13:08:01,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:01,853 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-15 13:08:01,853 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:01,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-15 13:08:01,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:01,874 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-15 13:08:01,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 13:08:01,874 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:01,874 INFO L499 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:01,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 13:08:02,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:02,098 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:02,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:02,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1478947275, now seen corresponding path program 14 times [2022-04-15 13:08:02,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:02,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586187607] [2022-04-15 13:08:02,267 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:02,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1940012691, now seen corresponding path program 1 times [2022-04-15 13:08:02,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:02,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064424636] [2022-04-15 13:08:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:02,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:08:02,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [765296798] [2022-04-15 13:08:02,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:02,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:02,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:02,278 INFO L229 MonitoredProcess]: Starting monitored process 16 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:08:02,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:08:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:02,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:08:02,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:02,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:02,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2462#true} call ULTIMATE.init(); {2462#true} is VALID [2022-04-15 13:08:02,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {2462#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);~SIZE~0 := 40000; {2470#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:02,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {2470#(<= 40000 ~SIZE~0)} assume true; {2470#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:02,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2470#(<= 40000 ~SIZE~0)} {2462#true} #45#return; {2470#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:02,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {2470#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2470#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:02,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {2470#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2483#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:02,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {2483#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [75] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_14 v_main_~i~0_Out_28) (= v_main_~sum~0_In_14 v_main_~sum~0_Out_28) (= v_~SIZE~0_In_14 v_~SIZE~0_In_14)) (and (= v_main_~i~0_Out_28 0) (= v_main_~i~0_Out_28 v_main_~i~0_In_14) (< v_main_~i~0_Out_28 (+ v_~SIZE~0_In_14 1)) (<= v_main_~sum~0_In_14 v_main_~sum~0_Out_28))) InVars {~SIZE~0=v_~SIZE~0_In_14, main_~i~0=v_main_~i~0_In_14, main_~sum~0=v_main_~sum~0_In_14} OutVars{~SIZE~0=v_~SIZE~0_In_14, main_~i~0=v_main_~i~0_Out_28, main_~sum~0=v_main_~sum~0_Out_28} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {2483#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:02,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {2483#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [74] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2463#false} is VALID [2022-04-15 13:08:02,375 INFO L272 TraceCheckUtils]: 8: Hoare triple {2463#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2463#false} is VALID [2022-04-15 13:08:02,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {2463#false} ~cond := #in~cond; {2463#false} is VALID [2022-04-15 13:08:02,375 INFO L290 TraceCheckUtils]: 10: Hoare triple {2463#false} assume 0 == ~cond; {2463#false} is VALID [2022-04-15 13:08:02,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {2463#false} assume !false; {2463#false} is VALID [2022-04-15 13:08:02,376 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:08:02,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:08:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064424636] [2022-04-15 13:08:02,376 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:08:02,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765296798] [2022-04-15 13:08:02,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765296798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:02,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:02,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:08:02,652 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:02,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586187607] [2022-04-15 13:08:02,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586187607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:02,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:02,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 13:08:02,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643964614] [2022-04-15 13:08:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:02,653 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:08:02,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:02,653 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:02,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:02,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 13:08:02,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:02,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 13:08:02,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:08:02,675 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:10,447 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:08:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:14,486 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:08:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 13:08:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-15 13:08:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:14,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 13:08:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-15 13:08:14,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-15 13:08:14,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:14,515 INFO L225 Difference]: With dead ends: 32 [2022-04-15 13:08:14,515 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 13:08:14,515 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2022-04-15 13:08:14,516 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:14,516 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 69 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 310 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 13:08:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 13:08:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 13:08:14,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:14,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,540 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,540 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:14,541 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:08:14,541 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:08:14,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:14,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:14,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:08:14,541 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 13:08:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:14,542 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 13:08:14,542 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:08:14,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:14,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:14,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:14,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:14,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 13:08:14,543 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-15 13:08:14,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:14,543 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 13:08:14,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:14,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 13:08:14,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 13:08:14,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 13:08:14,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:14,563 INFO L499 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:14,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 13:08:14,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:08:14,767 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:14,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:14,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1362779662, now seen corresponding path program 15 times [2022-04-15 13:08:14,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:14,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765692112] [2022-04-15 13:08:14,951 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1999118035, now seen corresponding path program 1 times [2022-04-15 13:08:14,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:14,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535568126] [2022-04-15 13:08:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:14,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:14,959 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:08:14,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1069387436] [2022-04-15 13:08:14,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:14,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:14,960 INFO L229 MonitoredProcess]: Starting monitored process 17 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:08:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:08:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:14,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:08:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:14,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:15,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {2687#true} call ULTIMATE.init(); {2687#true} is VALID [2022-04-15 13:08:15,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {2687#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);~SIZE~0 := 40000; {2695#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:15,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {2695#(<= 40000 ~SIZE~0)} assume true; {2695#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:15,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2695#(<= 40000 ~SIZE~0)} {2687#true} #45#return; {2695#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:15,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {2695#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2695#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:15,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {2695#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2708#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:15,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {2708#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [77] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_15 v_main_~sum~0_Out_30) (= v_~SIZE~0_In_15 v_~SIZE~0_In_15) (= v_main_~i~0_In_15 v_main_~i~0_Out_30)) (and (= v_main_~i~0_Out_30 v_main_~i~0_In_15) (= v_main_~i~0_Out_30 0) (< v_main_~i~0_Out_30 (+ v_~SIZE~0_In_15 1)) (<= v_main_~sum~0_In_15 v_main_~sum~0_Out_30))) InVars {~SIZE~0=v_~SIZE~0_In_15, main_~i~0=v_main_~i~0_In_15, main_~sum~0=v_main_~sum~0_In_15} OutVars{~SIZE~0=v_~SIZE~0_In_15, main_~i~0=v_main_~i~0_Out_30, main_~sum~0=v_main_~sum~0_Out_30} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {2708#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:15,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {2708#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [76] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2688#false} is VALID [2022-04-15 13:08:15,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {2688#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2688#false} is VALID [2022-04-15 13:08:15,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {2688#false} ~cond := #in~cond; {2688#false} is VALID [2022-04-15 13:08:15,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {2688#false} assume 0 == ~cond; {2688#false} is VALID [2022-04-15 13:08:15,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {2688#false} assume !false; {2688#false} is VALID [2022-04-15 13:08:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:15,071 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:08:15,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535568126] [2022-04-15 13:08:15,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:08:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069387436] [2022-04-15 13:08:15,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1069387436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:15,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:15,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:08:15,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:15,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765692112] [2022-04-15 13:08:15,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765692112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:15,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:15,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 13:08:15,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180731444] [2022-04-15 13:08:15,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:15,402 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:08:15,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:15,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:15,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:15,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 13:08:15,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:15,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 13:08:15,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:08:15,429 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:23,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:08:26,001 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:08:45,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:45,752 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:08:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 13:08:45,753 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 13:08:45,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:45,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 13:08:45,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-15 13:08:45,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-15 13:08:45,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:45,782 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:08:45,782 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:08:45,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:08:45,783 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:45,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 85 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 351 Invalid, 2 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 13:08:45,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:08:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 13:08:45,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:45,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,805 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,805 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:45,805 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:08:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:08:45,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:45,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:45,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:08:45,806 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 13:08:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:45,807 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-15 13:08:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:08:45,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:45,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:45,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:45,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:45,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-15 13:08:45,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-15 13:08:45,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:45,808 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-15 13:08:45,808 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:45,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-15 13:08:45,835 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:08:45,835 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-15 13:08:45,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:08:45,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:45,836 INFO L499 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:45,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 13:08:46,036 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 13:08:46,036 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 737998507, now seen corresponding path program 16 times [2022-04-15 13:08:46,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:46,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1518050127] [2022-04-15 13:08:46,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:46,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2058223379, now seen corresponding path program 1 times [2022-04-15 13:08:46,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:46,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396962671] [2022-04-15 13:08:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:46,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:08:46,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563116359] [2022-04-15 13:08:46,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:46,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:46,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:46,262 INFO L229 MonitoredProcess]: Starting monitored process 18 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:08:46,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 13:08:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:46,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:08:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:46,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:46,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {2919#true} call ULTIMATE.init(); {2919#true} is VALID [2022-04-15 13:08:46,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#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);~SIZE~0 := 40000; {2927#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:46,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {2927#(<= 40000 ~SIZE~0)} assume true; {2927#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:46,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2927#(<= 40000 ~SIZE~0)} {2919#true} #45#return; {2927#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:46,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {2927#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {2927#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:46,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {2927#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {2940#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:08:46,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {2940#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [79] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_32 v_main_~i~0_In_16) (<= v_main_~sum~0_In_16 v_main_~sum~0_Out_32) (< v_main_~i~0_Out_32 (+ v_~SIZE~0_In_16 1)) (= v_main_~i~0_Out_32 0)) (and (= v_~SIZE~0_In_16 v_~SIZE~0_In_16) (= v_main_~sum~0_In_16 v_main_~sum~0_Out_32) (= v_main_~i~0_In_16 v_main_~i~0_Out_32))) InVars {~SIZE~0=v_~SIZE~0_In_16, main_~i~0=v_main_~i~0_In_16, main_~sum~0=v_main_~sum~0_In_16} OutVars{~SIZE~0=v_~SIZE~0_In_16, main_~i~0=v_main_~i~0_Out_32, main_~sum~0=v_main_~sum~0_Out_32} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {2940#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:08:46,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {2940#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [78] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {2920#false} is VALID [2022-04-15 13:08:46,399 INFO L272 TraceCheckUtils]: 8: Hoare triple {2920#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {2920#false} is VALID [2022-04-15 13:08:46,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {2920#false} ~cond := #in~cond; {2920#false} is VALID [2022-04-15 13:08:46,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {2920#false} assume 0 == ~cond; {2920#false} is VALID [2022-04-15 13:08:46,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {2920#false} assume !false; {2920#false} is VALID [2022-04-15 13:08:46,399 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:08:46,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:08:46,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396962671] [2022-04-15 13:08:46,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:08:46,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563116359] [2022-04-15 13:08:46,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563116359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:46,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:46,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:08:46,821 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:46,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1518050127] [2022-04-15 13:08:46,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1518050127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:46,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:46,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:08:46,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921908235] [2022-04-15 13:08:46,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:46,822 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:08:46,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:46,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:46,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:46,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:08:46,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:46,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:08:46,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:08:46,842 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:51,183 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:08:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:08:51,183 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-15 13:08:51,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:51,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 13:08:51,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-15 13:08:51,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-15 13:08:51,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:51,229 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:08:51,229 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:08:51,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:08:51,229 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:51,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:08:51,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:08:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-15 13:08:51,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:51,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,252 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,253 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:51,253 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:08:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:08:51,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:51,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:51,253 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:08:51,253 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-15 13:08:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:51,254 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-15 13:08:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:08:51,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:51,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:51,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:51,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-15 13:08:51,255 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-15 13:08:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:51,255 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-15 13:08:51,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:51,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-15 13:08:51,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:51,279 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-15 13:08:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:08:51,279 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:51,279 INFO L499 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:51,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 13:08:51,483 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 13:08:51,484 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1437612306, now seen corresponding path program 17 times [2022-04-15 13:08:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:51,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1133853127] [2022-04-15 13:08:51,657 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:08:51,659 INFO L85 PathProgramCache]: Analyzing trace with hash 2117328723, now seen corresponding path program 1 times [2022-04-15 13:08:51,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:51,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294013081] [2022-04-15 13:08:51,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:51,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:51,666 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:08:51,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861542146] [2022-04-15 13:08:51,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:51,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:51,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:51,668 INFO L229 MonitoredProcess]: Starting monitored process 19 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:08:51,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 13:08:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:51,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:08:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:51,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:51,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {3158#true} call ULTIMATE.init(); {3158#true} is VALID [2022-04-15 13:08:51,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3158#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);~SIZE~0 := 40000; {3166#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:51,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3166#(<= 40000 ~SIZE~0)} assume true; {3166#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:51,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3166#(<= 40000 ~SIZE~0)} {3158#true} #45#return; {3166#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:51,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {3166#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3166#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:08:51,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {3166#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3179#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:51,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {3179#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [81] L23-2-->L23-3_primed: Formula: (or (and (= v_~SIZE~0_In_17 v_~SIZE~0_In_17) (= v_main_~i~0_In_17 v_main_~i~0_Out_34) (= v_main_~sum~0_In_17 v_main_~sum~0_Out_34)) (and (< v_main_~i~0_Out_34 (+ v_~SIZE~0_In_17 1)) (= v_main_~i~0_Out_34 v_main_~i~0_In_17) (= v_main_~i~0_Out_34 0) (<= v_main_~sum~0_In_17 v_main_~sum~0_Out_34))) InVars {~SIZE~0=v_~SIZE~0_In_17, main_~i~0=v_main_~i~0_In_17, main_~sum~0=v_main_~sum~0_In_17} OutVars{~SIZE~0=v_~SIZE~0_In_17, main_~i~0=v_main_~i~0_Out_34, main_~sum~0=v_main_~sum~0_Out_34} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {3179#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:08:51,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {3179#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [80] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3159#false} is VALID [2022-04-15 13:08:51,763 INFO L272 TraceCheckUtils]: 8: Hoare triple {3159#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3159#false} is VALID [2022-04-15 13:08:51,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {3159#false} ~cond := #in~cond; {3159#false} is VALID [2022-04-15 13:08:51,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {3159#false} assume 0 == ~cond; {3159#false} is VALID [2022-04-15 13:08:51,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {3159#false} assume !false; {3159#false} is VALID [2022-04-15 13:08:51,763 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:08:51,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:08:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294013081] [2022-04-15 13:08:51,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:08:51,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861542146] [2022-04-15 13:08:51,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861542146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:51,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:51,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:08:52,085 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:52,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1133853127] [2022-04-15 13:08:52,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1133853127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:52,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:52,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:08:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724756467] [2022-04-15 13:08:52,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:52,086 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:08:52,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:52,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:52,106 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:08:52,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:08:52,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:08:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:08:52,108 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:10,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:09:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:17,635 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:09:17,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:09:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:09:17,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 13:09:17,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-15 13:09:17,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-15 13:09:17,666 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:09:17,666 INFO L225 Difference]: With dead ends: 35 [2022-04-15 13:09:17,666 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 13:09:17,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:09:17,667 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 18 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:17,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 100 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 432 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-04-15 13:09:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 13:09:17,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 13:09:17,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:17,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,694 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,694 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:17,694 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:09:17,694 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:09:17,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:17,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:17,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:09:17,695 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-15 13:09:17,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:17,695 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-15 13:09:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:09:17,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:17,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:17,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:17,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:17,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-15 13:09:17,696 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-15 13:09:17,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:17,696 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-15 13:09:17,696 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:17,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-15 13:09:17,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-15 13:09:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 13:09:17,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:17,721 INFO L499 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:17,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 13:09:17,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:09:17,932 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1650803595, now seen corresponding path program 18 times [2022-04-15 13:09:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [313944161] [2022-04-15 13:09:18,102 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:18,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2118533229, now seen corresponding path program 1 times [2022-04-15 13:09:18,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:18,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582285475] [2022-04-15 13:09:18,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:18,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:18,110 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:09:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1265981248] [2022-04-15 13:09:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:18,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:18,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:18,111 INFO L229 MonitoredProcess]: Starting monitored process 20 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:09:18,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 13:09:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:18,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:09:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:18,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:18,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {3404#true} call ULTIMATE.init(); {3404#true} is VALID [2022-04-15 13:09:18,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {3404#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);~SIZE~0 := 40000; {3412#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:18,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {3412#(<= 40000 ~SIZE~0)} assume true; {3412#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:18,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3412#(<= 40000 ~SIZE~0)} {3404#true} #45#return; {3412#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:18,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {3412#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3412#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:18,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {3412#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3425#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:18,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {3425#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [83] L23-2-->L23-3_primed: Formula: (or (and (<= v_main_~sum~0_In_18 v_main_~sum~0_Out_36) (= v_main_~i~0_Out_36 v_main_~i~0_In_18) (< v_main_~i~0_Out_36 (+ v_~SIZE~0_In_18 1)) (= v_main_~i~0_Out_36 0)) (and (= v_main_~i~0_In_18 v_main_~i~0_Out_36) (= v_main_~sum~0_In_18 v_main_~sum~0_Out_36) (= v_~SIZE~0_In_18 v_~SIZE~0_In_18))) InVars {~SIZE~0=v_~SIZE~0_In_18, main_~i~0=v_main_~i~0_In_18, main_~sum~0=v_main_~sum~0_In_18} OutVars{~SIZE~0=v_~SIZE~0_In_18, main_~i~0=v_main_~i~0_Out_36, main_~sum~0=v_main_~sum~0_Out_36} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {3425#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:18,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {3425#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [82] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3405#false} is VALID [2022-04-15 13:09:18,209 INFO L272 TraceCheckUtils]: 8: Hoare triple {3405#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3405#false} is VALID [2022-04-15 13:09:18,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {3405#false} ~cond := #in~cond; {3405#false} is VALID [2022-04-15 13:09:18,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {3405#false} assume 0 == ~cond; {3405#false} is VALID [2022-04-15 13:09:18,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {3405#false} assume !false; {3405#false} is VALID [2022-04-15 13:09:18,209 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:09:18,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:09:18,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:18,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582285475] [2022-04-15 13:09:18,210 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:09:18,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265981248] [2022-04-15 13:09:18,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265981248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:18,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:18,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:18,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:18,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [313944161] [2022-04-15 13:09:18,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [313944161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:18,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:18,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 13:09:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670995894] [2022-04-15 13:09:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:18,698 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 13:09:18,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:18,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:18,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:18,721 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 13:09:18,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:18,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 13:09:18,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:09:18,722 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,040 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:09:25,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 13:09:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-15 13:09:25,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:25,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 13:09:25,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-15 13:09:25,043 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-15 13:09:25,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:25,078 INFO L225 Difference]: With dead ends: 36 [2022-04-15 13:09:25,078 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:09:25,078 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:09:25,079 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:25,079 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:09:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:09:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 13:09:25,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:25,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,101 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,101 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,102 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:09:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:09:25,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:25,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:25,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:09:25,102 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 13:09:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:25,103 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 13:09:25,103 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:09:25,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:25,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:25,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:25,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:25,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 13:09:25,104 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-15 13:09:25,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:25,104 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 13:09:25,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:25,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 13:09:25,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 13:09:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 13:09:25,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:25,132 INFO L499 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:25,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 13:09:25,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:25,332 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:25,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:25,333 INFO L85 PathProgramCache]: Analyzing trace with hash -330201038, now seen corresponding path program 19 times [2022-04-15 13:09:25,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:25,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1643881681] [2022-04-15 13:09:25,502 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:25,503 INFO L85 PathProgramCache]: Analyzing trace with hash -2059427885, now seen corresponding path program 1 times [2022-04-15 13:09:25,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:25,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927142712] [2022-04-15 13:09:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:25,509 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:09:25,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1483804247] [2022-04-15 13:09:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:25,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:25,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:25,511 INFO L229 MonitoredProcess]: Starting monitored process 21 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:09:25,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 13:09:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:25,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:09:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:25,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:25,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {3657#true} call ULTIMATE.init(); {3657#true} is VALID [2022-04-15 13:09:25,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {3657#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);~SIZE~0 := 40000; {3665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:25,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {3665#(<= 40000 ~SIZE~0)} assume true; {3665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:25,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3665#(<= 40000 ~SIZE~0)} {3657#true} #45#return; {3665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:25,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {3665#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:25,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {3665#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3678#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:25,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {3678#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [85] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_38 v_main_~i~0_In_19) (= v_main_~i~0_Out_38 0) (< v_main_~i~0_Out_38 (+ v_~SIZE~0_In_19 1)) (<= v_main_~sum~0_In_19 v_main_~sum~0_Out_38)) (and (= v_main_~i~0_In_19 v_main_~i~0_Out_38) (= v_main_~sum~0_In_19 v_main_~sum~0_Out_38) (= v_~SIZE~0_In_19 v_~SIZE~0_In_19))) InVars {~SIZE~0=v_~SIZE~0_In_19, main_~i~0=v_main_~i~0_In_19, main_~sum~0=v_main_~sum~0_In_19} OutVars{~SIZE~0=v_~SIZE~0_In_19, main_~i~0=v_main_~i~0_Out_38, main_~sum~0=v_main_~sum~0_Out_38} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {3678#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:25,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {3678#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [84] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3658#false} is VALID [2022-04-15 13:09:25,617 INFO L272 TraceCheckUtils]: 8: Hoare triple {3658#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3658#false} is VALID [2022-04-15 13:09:25,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {3658#false} ~cond := #in~cond; {3658#false} is VALID [2022-04-15 13:09:25,617 INFO L290 TraceCheckUtils]: 10: Hoare triple {3658#false} assume 0 == ~cond; {3658#false} is VALID [2022-04-15 13:09:25,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {3658#false} assume !false; {3658#false} is VALID [2022-04-15 13:09:25,617 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:09:25,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:09:25,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:25,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927142712] [2022-04-15 13:09:25,618 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:09:25,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483804247] [2022-04-15 13:09:25,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483804247] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:25,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:25,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:26,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:26,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1643881681] [2022-04-15 13:09:26,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1643881681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:26,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:26,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 13:09:26,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646380936] [2022-04-15 13:09:26,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:26,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 13:09:26,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:26,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:26,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:26,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 13:09:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:26,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 13:09:26,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:09:26,213 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:09:32,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:32,354 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:09:32,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 13:09:32,354 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 13:09:32,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:32,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 13:09:32,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-15 13:09:32,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-15 13:09:32,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:32,385 INFO L225 Difference]: With dead ends: 37 [2022-04-15 13:09:32,385 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 13:09:32,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2022-04-15 13:09:32,386 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:32,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 13:09:32,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 13:09:32,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 13:09:32,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:32,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,411 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,411 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:32,411 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:09:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:09:32,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:32,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:32,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 13:09:32,412 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-15 13:09:32,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:32,412 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-15 13:09:32,412 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:09:32,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:32,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:32,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:32,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-15 13:09:32,413 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-15 13:09:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:32,413 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-15 13:09:32,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:32,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-15 13:09:32,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:32,437 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-15 13:09:32,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 13:09:32,437 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:32,437 INFO L499 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:32,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 13:09:32,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:32,638 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:32,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:32,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1611802517, now seen corresponding path program 20 times [2022-04-15 13:09:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:32,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [760204116] [2022-04-15 13:09:32,841 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:32,842 INFO L85 PathProgramCache]: Analyzing trace with hash -2000322541, now seen corresponding path program 1 times [2022-04-15 13:09:32,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:32,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546925061] [2022-04-15 13:09:32,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:32,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:32,848 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:09:32,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444788663] [2022-04-15 13:09:32,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:32,851 INFO L229 MonitoredProcess]: Starting monitored process 22 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:09:32,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 13:09:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:32,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:09:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:32,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:32,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {3917#true} call ULTIMATE.init(); {3917#true} is VALID [2022-04-15 13:09:32,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {3917#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);~SIZE~0 := 40000; {3925#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:32,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {3925#(<= 40000 ~SIZE~0)} assume true; {3925#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:32,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3925#(<= 40000 ~SIZE~0)} {3917#true} #45#return; {3925#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:32,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {3925#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {3925#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:32,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {3925#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {3938#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:32,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {3938#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [87] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_40 v_main_~i~0_In_20) (< v_main_~i~0_Out_40 (+ v_~SIZE~0_In_20 1)) (= v_main_~i~0_Out_40 0) (<= v_main_~sum~0_In_20 v_main_~sum~0_Out_40)) (and (= v_main_~sum~0_In_20 v_main_~sum~0_Out_40) (= v_main_~i~0_In_20 v_main_~i~0_Out_40) (= v_~SIZE~0_In_20 v_~SIZE~0_In_20))) InVars {~SIZE~0=v_~SIZE~0_In_20, main_~i~0=v_main_~i~0_In_20, main_~sum~0=v_main_~sum~0_In_20} OutVars{~SIZE~0=v_~SIZE~0_In_20, main_~i~0=v_main_~i~0_Out_40, main_~sum~0=v_main_~sum~0_Out_40} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {3938#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:32,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {3938#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [86] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {3918#false} is VALID [2022-04-15 13:09:32,948 INFO L272 TraceCheckUtils]: 8: Hoare triple {3918#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {3918#false} is VALID [2022-04-15 13:09:32,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {3918#false} ~cond := #in~cond; {3918#false} is VALID [2022-04-15 13:09:32,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {3918#false} assume 0 == ~cond; {3918#false} is VALID [2022-04-15 13:09:32,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {3918#false} assume !false; {3918#false} is VALID [2022-04-15 13:09:32,949 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:09:32,949 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:09:32,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546925061] [2022-04-15 13:09:32,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:09:32,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444788663] [2022-04-15 13:09:32,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444788663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:32,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:32,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:33,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:33,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [760204116] [2022-04-15 13:09:33,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [760204116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:33,564 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:33,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 13:09:33,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714982550] [2022-04-15 13:09:33,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:33,565 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 13:09:33,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:33,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:33,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:33,587 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 13:09:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 13:09:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:09:33,588 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:39,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:09:43,797 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:09:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:45,849 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:09:45,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 13:09:45,849 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-15 13:09:45,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:45,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 13:09:45,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-15 13:09:45,851 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-15 13:09:45,878 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:09:45,879 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:09:45,879 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 13:09:45,879 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2022-04-15 13:09:45,880 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 24 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:45,880 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 48 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 13:09:45,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 13:09:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 13:09:45,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:45,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,903 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,903 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:45,904 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:09:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:09:45,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:45,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:45,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:09:45,905 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-15 13:09:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:45,905 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-15 13:09:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:09:45,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:45,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:45,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:45,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-15 13:09:45,907 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-15 13:09:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:45,907 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-15 13:09:45,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:45,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-15 13:09:45,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-15 13:09:45,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:09:45,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:45,942 INFO L499 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:45,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 13:09:46,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:46,142 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:46,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1608224594, now seen corresponding path program 21 times [2022-04-15 13:09:46,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:46,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1436006075] [2022-04-15 13:09:48,340 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1941217197, now seen corresponding path program 1 times [2022-04-15 13:09:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:48,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474690968] [2022-04-15 13:09:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:48,349 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:09:48,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380983654] [2022-04-15 13:09:48,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:48,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:48,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:48,350 INFO L229 MonitoredProcess]: Starting monitored process 23 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:09:48,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 13:09:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:48,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:09:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:48,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:48,452 INFO L272 TraceCheckUtils]: 0: Hoare triple {4184#true} call ULTIMATE.init(); {4184#true} is VALID [2022-04-15 13:09:48,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {4184#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);~SIZE~0 := 40000; {4192#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:48,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {4192#(<= 40000 ~SIZE~0)} assume true; {4192#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:48,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4192#(<= 40000 ~SIZE~0)} {4184#true} #45#return; {4192#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:48,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {4192#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4192#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:48,454 INFO L290 TraceCheckUtils]: 5: Hoare triple {4192#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4205#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:48,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {4205#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [89] L23-2-->L23-3_primed: Formula: (or (and (< v_main_~i~0_Out_42 (+ v_~SIZE~0_In_21 1)) (<= v_main_~sum~0_In_21 v_main_~sum~0_Out_42) (= v_main_~i~0_Out_42 0) (= v_main_~i~0_Out_42 v_main_~i~0_In_21)) (and (= v_main_~sum~0_In_21 v_main_~sum~0_Out_42) (= v_main_~i~0_In_21 v_main_~i~0_Out_42) (= v_~SIZE~0_In_21 v_~SIZE~0_In_21))) InVars {~SIZE~0=v_~SIZE~0_In_21, main_~i~0=v_main_~i~0_In_21, main_~sum~0=v_main_~sum~0_In_21} OutVars{~SIZE~0=v_~SIZE~0_In_21, main_~i~0=v_main_~i~0_Out_42, main_~sum~0=v_main_~sum~0_Out_42} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {4205#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:48,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {4205#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [88] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {4185#false} is VALID [2022-04-15 13:09:48,457 INFO L272 TraceCheckUtils]: 8: Hoare triple {4185#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4185#false} is VALID [2022-04-15 13:09:48,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {4185#false} ~cond := #in~cond; {4185#false} is VALID [2022-04-15 13:09:48,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {4185#false} assume 0 == ~cond; {4185#false} is VALID [2022-04-15 13:09:48,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {4185#false} assume !false; {4185#false} is VALID [2022-04-15 13:09:48,457 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:09:48,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:09:48,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:48,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474690968] [2022-04-15 13:09:48,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:09:48,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380983654] [2022-04-15 13:09:48,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380983654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:48,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:48,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:49,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:49,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1436006075] [2022-04-15 13:09:49,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1436006075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:49,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:49,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:09:49,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151292056] [2022-04-15 13:09:49,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:49,112 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 13:09:49,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:49,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:49,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:49,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:09:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:09:49,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-04-15 13:09:49,136 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:53,275 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:09:55,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:55,563 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:09:55,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:09:55,563 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-15 13:09:55,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 13:09:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-15 13:09:55,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-15 13:09:55,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:55,602 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:09:55,602 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:09:55,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-04-15 13:09:55,603 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:55,603 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 13:09:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:09:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 13:09:55,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:55,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,630 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,630 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:55,631 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:09:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:09:55,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:55,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:55,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:09:55,632 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 13:09:55,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:55,632 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-15 13:09:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:09:55,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:55,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:55,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:55,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:55,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-15 13:09:55,634 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-15 13:09:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:55,634 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-15 13:09:55,634 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:55,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-15 13:09:55,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:55,671 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-15 13:09:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 13:09:55,671 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:55,671 INFO L499 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:55,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 13:09:55,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:55,872 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:55,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1650150069, now seen corresponding path program 22 times [2022-04-15 13:09:55,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:55,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1836446032] [2022-04-15 13:09:56,051 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:09:56,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1882111853, now seen corresponding path program 1 times [2022-04-15 13:09:56,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:56,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567455541] [2022-04-15 13:09:56,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:56,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:56,064 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:09:56,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491816662] [2022-04-15 13:09:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:56,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:56,065 INFO L229 MonitoredProcess]: Starting monitored process 24 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:09:56,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 13:09:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:56,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:09:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:56,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:56,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {4458#true} call ULTIMATE.init(); {4458#true} is VALID [2022-04-15 13:09:56,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {4458#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);~SIZE~0 := 40000; {4466#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:56,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {4466#(<= 40000 ~SIZE~0)} assume true; {4466#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:56,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4466#(<= 40000 ~SIZE~0)} {4458#true} #45#return; {4466#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:56,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {4466#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4466#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:09:56,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {4466#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4479#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:56,172 INFO L290 TraceCheckUtils]: 6: Hoare triple {4479#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [91] L23-2-->L23-3_primed: Formula: (or (and (< v_main_~i~0_Out_44 (+ v_~SIZE~0_In_22 1)) (= v_main_~i~0_Out_44 v_main_~i~0_In_22) (<= v_main_~sum~0_In_22 v_main_~sum~0_Out_44) (= v_main_~i~0_Out_44 0)) (and (= v_main_~i~0_In_22 v_main_~i~0_Out_44) (= v_main_~sum~0_In_22 v_main_~sum~0_Out_44) (= v_~SIZE~0_In_22 v_~SIZE~0_In_22))) InVars {~SIZE~0=v_~SIZE~0_In_22, main_~i~0=v_main_~i~0_In_22, main_~sum~0=v_main_~sum~0_In_22} OutVars{~SIZE~0=v_~SIZE~0_In_22, main_~i~0=v_main_~i~0_Out_44, main_~sum~0=v_main_~sum~0_Out_44} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {4479#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:09:56,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {4479#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [90] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {4459#false} is VALID [2022-04-15 13:09:56,173 INFO L272 TraceCheckUtils]: 8: Hoare triple {4459#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4459#false} is VALID [2022-04-15 13:09:56,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {4459#false} ~cond := #in~cond; {4459#false} is VALID [2022-04-15 13:09:56,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {4459#false} assume 0 == ~cond; {4459#false} is VALID [2022-04-15 13:09:56,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {4459#false} assume !false; {4459#false} is VALID [2022-04-15 13:09:56,173 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:09:56,173 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:09:56,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:56,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567455541] [2022-04-15 13:09:56,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:09:56,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491816662] [2022-04-15 13:09:56,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491816662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:56,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:56,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:09:56,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:56,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1836446032] [2022-04-15 13:09:56,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1836446032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:56,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:56,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 13:09:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033083061] [2022-04-15 13:09:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 13:09:56,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:56,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:56,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:56,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 13:09:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:56,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 13:09:56,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:09:56,951 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:02,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:10:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:06,555 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:10:06,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 13:10:06,555 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-15 13:10:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:06,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 13:10:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-15 13:10:06,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-15 13:10:06,594 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:10:06,595 INFO L225 Difference]: With dead ends: 40 [2022-04-15 13:10:06,595 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:10:06,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2022-04-15 13:10:06,596 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:06,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 40 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 13:10:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:10:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 13:10:06,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:06,638 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,638 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,638 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:06,639 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:10:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:10:06,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:06,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:06,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:10:06,639 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:10:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:06,640 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 13:10:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:10:06,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:06,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:06,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:06,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 13:10:06,641 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-15 13:10:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:06,641 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 13:10:06,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:06,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 13:10:06,668 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:10:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 13:10:06,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:10:06,669 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:06,669 INFO L499 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:06,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:06,871 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:06,871 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:06,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 419450482, now seen corresponding path program 23 times [2022-04-15 13:10:06,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:06,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957604144] [2022-04-15 13:10:07,069 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:07,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1823006509, now seen corresponding path program 1 times [2022-04-15 13:10:07,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:07,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459737448] [2022-04-15 13:10:07,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:07,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:07,077 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:10:07,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590766427] [2022-04-15 13:10:07,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:07,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:07,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:07,081 INFO L229 MonitoredProcess]: Starting monitored process 25 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:10:07,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 13:10:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:07,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:10:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:07,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:07,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {4739#true} call ULTIMATE.init(); {4739#true} is VALID [2022-04-15 13:10:07,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {4739#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);~SIZE~0 := 40000; {4747#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:07,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {4747#(<= 40000 ~SIZE~0)} assume true; {4747#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:07,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4747#(<= 40000 ~SIZE~0)} {4739#true} #45#return; {4747#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:07,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {4747#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {4747#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:07,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {4747#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {4760#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:10:07,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {4760#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [93] L23-2-->L23-3_primed: Formula: (or (and (= v_~SIZE~0_In_23 v_~SIZE~0_In_23) (= v_main_~sum~0_In_23 v_main_~sum~0_Out_46) (= v_main_~i~0_In_23 v_main_~i~0_Out_46)) (and (< v_main_~i~0_Out_46 (+ v_~SIZE~0_In_23 1)) (= v_main_~i~0_Out_46 v_main_~i~0_In_23) (<= v_main_~sum~0_In_23 v_main_~sum~0_Out_46) (= v_main_~i~0_Out_46 0))) InVars {~SIZE~0=v_~SIZE~0_In_23, main_~i~0=v_main_~i~0_In_23, main_~sum~0=v_main_~sum~0_In_23} OutVars{~SIZE~0=v_~SIZE~0_In_23, main_~i~0=v_main_~i~0_Out_46, main_~sum~0=v_main_~sum~0_Out_46} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {4760#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:10:07,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {4760#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [92] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {4740#false} is VALID [2022-04-15 13:10:07,165 INFO L272 TraceCheckUtils]: 8: Hoare triple {4740#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {4740#false} is VALID [2022-04-15 13:10:07,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {4740#false} ~cond := #in~cond; {4740#false} is VALID [2022-04-15 13:10:07,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {4740#false} assume 0 == ~cond; {4740#false} is VALID [2022-04-15 13:10:07,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {4740#false} assume !false; {4740#false} is VALID [2022-04-15 13:10:07,165 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:10:07,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:10:07,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:07,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459737448] [2022-04-15 13:10:07,165 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:10:07,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590766427] [2022-04-15 13:10:07,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590766427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:07,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:07,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:07,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:07,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957604144] [2022-04-15 13:10:07,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957604144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:07,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:07,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 13:10:07,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008374090] [2022-04-15 13:10:07,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 13:10:07,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:07,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:07,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:07,685 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 13:10:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 13:10:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:10:07,686 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:11,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:10:37,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:37,203 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:10:37,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 13:10:37,204 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 13:10:37,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 13:10:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-15 13:10:37,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-15 13:10:37,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:37,253 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:10:37,253 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:10:37,253 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2022-04-15 13:10:37,253 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:37,254 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 108 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 720 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-15 13:10:37,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:10:37,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 13:10:37,280 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:37,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,280 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,280 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:37,281 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:10:37,281 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:10:37,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:37,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:37,281 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:10:37,282 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:10:37,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:37,282 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-15 13:10:37,282 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:10:37,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:37,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:37,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:37,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-15 13:10:37,283 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-15 13:10:37,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:37,283 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-15 13:10:37,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:37,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-15 13:10:37,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:37,328 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-15 13:10:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:10:37,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:37,328 INFO L499 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:37,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:37,528 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:37,529 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:37,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 152558123, now seen corresponding path program 24 times [2022-04-15 13:10:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:37,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1647002309] [2022-04-15 13:10:37,696 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1763901165, now seen corresponding path program 1 times [2022-04-15 13:10:37,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:37,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81728678] [2022-04-15 13:10:37,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:37,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:37,703 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:10:37,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368733499] [2022-04-15 13:10:37,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:37,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:37,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:37,704 INFO L229 MonitoredProcess]: Starting monitored process 26 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:10:37,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 13:10:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:37,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:10:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:37,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:37,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {5027#true} call ULTIMATE.init(); {5027#true} is VALID [2022-04-15 13:10:37,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {5027#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);~SIZE~0 := 40000; {5035#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:37,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {5035#(<= 40000 ~SIZE~0)} assume true; {5035#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:37,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5035#(<= 40000 ~SIZE~0)} {5027#true} #45#return; {5035#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:37,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {5035#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5035#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:37,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {5035#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5048#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:37,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {5048#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [95] L23-2-->L23-3_primed: Formula: (or (and (<= v_main_~sum~0_In_24 v_main_~sum~0_Out_48) (< v_main_~i~0_Out_48 (+ v_~SIZE~0_In_24 1)) (= v_main_~i~0_Out_48 v_main_~i~0_In_24) (= v_main_~i~0_Out_48 0)) (and (= v_~SIZE~0_In_24 v_~SIZE~0_In_24) (= v_main_~sum~0_In_24 v_main_~sum~0_Out_48) (= v_main_~i~0_In_24 v_main_~i~0_Out_48))) InVars {~SIZE~0=v_~SIZE~0_In_24, main_~i~0=v_main_~i~0_In_24, main_~sum~0=v_main_~sum~0_In_24} OutVars{~SIZE~0=v_~SIZE~0_In_24, main_~i~0=v_main_~i~0_Out_48, main_~sum~0=v_main_~sum~0_Out_48} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {5048#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:37,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {5048#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [94] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5028#false} is VALID [2022-04-15 13:10:37,797 INFO L272 TraceCheckUtils]: 8: Hoare triple {5028#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5028#false} is VALID [2022-04-15 13:10:37,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {5028#false} ~cond := #in~cond; {5028#false} is VALID [2022-04-15 13:10:37,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {5028#false} assume 0 == ~cond; {5028#false} is VALID [2022-04-15 13:10:37,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {5028#false} assume !false; {5028#false} is VALID [2022-04-15 13:10:37,798 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:10:37,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:10:37,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81728678] [2022-04-15 13:10:37,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:10:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368733499] [2022-04-15 13:10:37,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368733499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:37,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:37,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:38,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:38,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1647002309] [2022-04-15 13:10:38,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1647002309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:38,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:38,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 13:10:38,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562441329] [2022-04-15 13:10:38,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:38,643 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:10:38,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:38,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:38,672 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:10:38,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 13:10:38,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:38,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 13:10:38,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:10:38,674 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:44,880 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:10:44,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:10:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-15 13:10:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 13:10:44,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-15 13:10:44,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-15 13:10:44,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:44,924 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:10:44,924 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 13:10:44,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2022-04-15 13:10:44,925 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:44,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:10:44,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 13:10:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 13:10:44,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:44,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,953 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,953 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:44,953 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:10:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:10:44,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:44,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:44,954 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:10:44,954 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:10:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:44,955 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-15 13:10:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:10:44,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:44,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:44,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:44,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-15 13:10:44,956 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-15 13:10:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:44,956 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-15 13:10:44,956 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:44,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-15 13:10:44,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:44,993 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-15 13:10:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 13:10:44,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:44,993 INFO L499 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:45,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-04-15 13:10:45,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 13:10:45,193 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:45,194 INFO L85 PathProgramCache]: Analyzing trace with hash 468829586, now seen corresponding path program 25 times [2022-04-15 13:10:45,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:45,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1871037065] [2022-04-15 13:10:45,381 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1704795821, now seen corresponding path program 1 times [2022-04-15 13:10:45,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:45,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914379767] [2022-04-15 13:10:45,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:45,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:45,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:10:45,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624434602] [2022-04-15 13:10:45,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:45,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:45,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:45,396 INFO L229 MonitoredProcess]: Starting monitored process 27 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:10:45,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 13:10:45,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:45,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:10:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:45,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:45,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {5322#true} call ULTIMATE.init(); {5322#true} is VALID [2022-04-15 13:10:45,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#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);~SIZE~0 := 40000; {5330#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:45,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {5330#(<= 40000 ~SIZE~0)} assume true; {5330#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:45,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5330#(<= 40000 ~SIZE~0)} {5322#true} #45#return; {5330#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:45,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {5330#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5330#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:45,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {5330#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5343#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:45,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {5343#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [97] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_50 v_main_~i~0_In_25) (= v_main_~i~0_Out_50 0) (< v_main_~i~0_Out_50 (+ v_~SIZE~0_In_25 1)) (<= v_main_~sum~0_In_25 v_main_~sum~0_Out_50)) (and (= v_~SIZE~0_In_25 v_~SIZE~0_In_25) (= v_main_~i~0_In_25 v_main_~i~0_Out_50) (= v_main_~sum~0_In_25 v_main_~sum~0_Out_50))) InVars {~SIZE~0=v_~SIZE~0_In_25, main_~i~0=v_main_~i~0_In_25, main_~sum~0=v_main_~sum~0_In_25} OutVars{~SIZE~0=v_~SIZE~0_In_25, main_~i~0=v_main_~i~0_Out_50, main_~sum~0=v_main_~sum~0_Out_50} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {5343#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:45,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {5343#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [96] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5323#false} is VALID [2022-04-15 13:10:45,489 INFO L272 TraceCheckUtils]: 8: Hoare triple {5323#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5323#false} is VALID [2022-04-15 13:10:45,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {5323#false} ~cond := #in~cond; {5323#false} is VALID [2022-04-15 13:10:45,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {5323#false} assume 0 == ~cond; {5323#false} is VALID [2022-04-15 13:10:45,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {5323#false} assume !false; {5323#false} is VALID [2022-04-15 13:10:45,490 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:10:45,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:10:45,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914379767] [2022-04-15 13:10:45,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:10:45,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624434602] [2022-04-15 13:10:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624434602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:45,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:46,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:46,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1871037065] [2022-04-15 13:10:46,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1871037065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:46,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:46,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 13:10:46,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219098654] [2022-04-15 13:10:46,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:46,509 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 13:10:46,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:46,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:46,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:46,544 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 13:10:46,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:46,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 13:10:46,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:10:46,545 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:55,298 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:10:55,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 13:10:55,298 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-15 13:10:55,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 13:10:55,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-15 13:10:55,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-15 13:10:55,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:55,336 INFO L225 Difference]: With dead ends: 43 [2022-04-15 13:10:55,336 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 13:10:55,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:10:55,337 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:55,337 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 13:10:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 13:10:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 13:10:55,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:55,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,367 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,367 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:55,368 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:10:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:10:55,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:55,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:55,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 13:10:55,368 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-15 13:10:55,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:55,369 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-15 13:10:55,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:10:55,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:55,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:55,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:55,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-15 13:10:55,370 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-15 13:10:55,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:55,370 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-15 13:10:55,370 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:55,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-15 13:10:55,404 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:10:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-15 13:10:55,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 13:10:55,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:55,404 INFO L499 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:55,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:55,605 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 13:10:55,605 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:55,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:55,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1683310347, now seen corresponding path program 26 times [2022-04-15 13:10:55,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:55,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1101791340] [2022-04-15 13:10:55,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:55,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1645690477, now seen corresponding path program 1 times [2022-04-15 13:10:55,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:55,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088830813] [2022-04-15 13:10:55,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:55,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:55,821 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:10:55,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598454106] [2022-04-15 13:10:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:55,823 INFO L229 MonitoredProcess]: Starting monitored process 28 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:10:55,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 13:10:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:55,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:10:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:55,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:55,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {5624#true} call ULTIMATE.init(); {5624#true} is VALID [2022-04-15 13:10:55,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {5624#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);~SIZE~0 := 40000; {5632#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:55,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {5632#(<= 40000 ~SIZE~0)} assume true; {5632#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:55,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5632#(<= 40000 ~SIZE~0)} {5624#true} #45#return; {5632#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:55,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {5632#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5632#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:55,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {5632#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5645#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:55,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [99] L23-2-->L23-3_primed: Formula: (or (and (<= v_main_~sum~0_In_26 v_main_~sum~0_Out_52) (= v_main_~i~0_Out_52 0) (< v_main_~i~0_Out_52 (+ v_~SIZE~0_In_26 1)) (= v_main_~i~0_Out_52 v_main_~i~0_In_26)) (and (= v_~SIZE~0_In_26 v_~SIZE~0_In_26) (= v_main_~i~0_In_26 v_main_~i~0_Out_52) (= v_main_~sum~0_In_26 v_main_~sum~0_Out_52))) InVars {~SIZE~0=v_~SIZE~0_In_26, main_~i~0=v_main_~i~0_In_26, main_~sum~0=v_main_~sum~0_In_26} OutVars{~SIZE~0=v_~SIZE~0_In_26, main_~i~0=v_main_~i~0_Out_52, main_~sum~0=v_main_~sum~0_Out_52} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {5645#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:55,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {5645#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [98] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5625#false} is VALID [2022-04-15 13:10:55,938 INFO L272 TraceCheckUtils]: 8: Hoare triple {5625#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5625#false} is VALID [2022-04-15 13:10:55,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {5625#false} ~cond := #in~cond; {5625#false} is VALID [2022-04-15 13:10:55,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {5625#false} assume 0 == ~cond; {5625#false} is VALID [2022-04-15 13:10:55,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {5625#false} assume !false; {5625#false} is VALID [2022-04-15 13:10:55,939 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:10:55,939 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:10:55,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088830813] [2022-04-15 13:10:55,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:10:55,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598454106] [2022-04-15 13:10:55,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598454106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:55,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:55,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:56,970 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1101791340] [2022-04-15 13:10:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1101791340] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:56,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 13:10:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603664900] [2022-04-15 13:10:56,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:56,971 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 13:10:56,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:56,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:57,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 13:10:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 13:10:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:10:57,006 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:57,308 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:10:57,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 13:10:57,308 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-15 13:10:57,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:57,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 13:10:57,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-15 13:10:57,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-15 13:10:57,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:57,346 INFO L225 Difference]: With dead ends: 44 [2022-04-15 13:10:57,346 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 13:10:57,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:10:57,349 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:57,350 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:10:57,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 13:10:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 13:10:57,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:57,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,387 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,387 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:57,388 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:10:57,388 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:10:57,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:57,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:57,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 13:10:57,388 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 13:10:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:57,389 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 13:10:57,389 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:10:57,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:57,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:57,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:57,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:57,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 13:10:57,390 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-15 13:10:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:57,390 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 13:10:57,390 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:57,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 13:10:57,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:10:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 13:10:57,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 13:10:57,436 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:57,436 INFO L499 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:57,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:57,636 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 13:10:57,637 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 677508274, now seen corresponding path program 27 times [2022-04-15 13:10:57,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:57,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574400567] [2022-04-15 13:10:57,820 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:57,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1586585133, now seen corresponding path program 1 times [2022-04-15 13:10:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:57,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384087952] [2022-04-15 13:10:57,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:57,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:57,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:10:57,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [976022453] [2022-04-15 13:10:57,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:57,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:57,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:57,827 INFO L229 MonitoredProcess]: Starting monitored process 29 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:10:57,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 13:10:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:57,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:10:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:57,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:10:57,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {5933#true} call ULTIMATE.init(); {5933#true} is VALID [2022-04-15 13:10:57,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {5933#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);~SIZE~0 := 40000; {5941#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:57,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {5941#(<= 40000 ~SIZE~0)} assume true; {5941#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:57,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5941#(<= 40000 ~SIZE~0)} {5933#true} #45#return; {5941#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:57,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {5941#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {5941#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:10:57,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {5941#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {5954#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:57,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {5954#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [101] L23-2-->L23-3_primed: Formula: (or (and (< v_main_~i~0_Out_54 (+ v_~SIZE~0_In_27 1)) (<= v_main_~sum~0_In_27 v_main_~sum~0_Out_54) (= v_main_~i~0_Out_54 0) (= v_main_~i~0_Out_54 v_main_~i~0_In_27)) (and (= v_~SIZE~0_In_27 v_~SIZE~0_In_27) (= v_main_~i~0_In_27 v_main_~i~0_Out_54) (= v_main_~sum~0_In_27 v_main_~sum~0_Out_54))) InVars {~SIZE~0=v_~SIZE~0_In_27, main_~i~0=v_main_~i~0_In_27, main_~sum~0=v_main_~sum~0_In_27} OutVars{~SIZE~0=v_~SIZE~0_In_27, main_~i~0=v_main_~i~0_Out_54, main_~sum~0=v_main_~sum~0_Out_54} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {5954#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:10:57,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {5954#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [100] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {5934#false} is VALID [2022-04-15 13:10:57,948 INFO L272 TraceCheckUtils]: 8: Hoare triple {5934#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {5934#false} is VALID [2022-04-15 13:10:57,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {5934#false} ~cond := #in~cond; {5934#false} is VALID [2022-04-15 13:10:57,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {5934#false} assume 0 == ~cond; {5934#false} is VALID [2022-04-15 13:10:57,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {5934#false} assume !false; {5934#false} is VALID [2022-04-15 13:10:57,948 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:10:57,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:10:57,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:57,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384087952] [2022-04-15 13:10:57,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:10:57,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976022453] [2022-04-15 13:10:57,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976022453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:57,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:57,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:10:59,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:59,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574400567] [2022-04-15 13:10:59,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574400567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:59,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:59,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 13:10:59,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103898113] [2022-04-15 13:10:59,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:59,168 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 13:10:59,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:59,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:59,206 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:10:59,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 13:10:59,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:59,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 13:10:59,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-04-15 13:10:59,207 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:03,406 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:07,423 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:07,439 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:11:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 13:11:07,439 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 13:11:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:07,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 13:11:07,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-15 13:11:07,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-15 13:11:07,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:07,489 INFO L225 Difference]: With dead ends: 45 [2022-04-15 13:11:07,489 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 13:11:07,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2022-04-15 13:11:07,490 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:07,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 43 Invalid, 2 Unknown, 0 Unchecked, 4.1s Time] [2022-04-15 13:11:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 13:11:07,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 13:11:07,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:07,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,520 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,520 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:07,521 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:11:07,521 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:11:07,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:07,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:07,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 13:11:07,521 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-15 13:11:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:07,522 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-15 13:11:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:11:07,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:07,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:07,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:07,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-15 13:11:07,523 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-15 13:11:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:07,523 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-15 13:11:07,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:07,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-15 13:11:07,567 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:11:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-15 13:11:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 13:11:07,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:07,567 INFO L499 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:07,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 13:11:07,768 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 13:11:07,768 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:07,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:07,768 INFO L85 PathProgramCache]: Analyzing trace with hash -437584917, now seen corresponding path program 28 times [2022-04-15 13:11:07,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:07,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [68014854] [2022-04-15 13:11:07,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:07,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1527479789, now seen corresponding path program 1 times [2022-04-15 13:11:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519281610] [2022-04-15 13:11:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:07,954 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:11:07,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117254440] [2022-04-15 13:11:07,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:07,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:07,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:11:07,955 INFO L229 MonitoredProcess]: Starting monitored process 30 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:11:07,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 13:11:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:07,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:11:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:07,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:11:08,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {6249#true} call ULTIMATE.init(); {6249#true} is VALID [2022-04-15 13:11:08,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {6249#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);~SIZE~0 := 40000; {6257#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:08,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {6257#(<= 40000 ~SIZE~0)} assume true; {6257#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:08,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6257#(<= 40000 ~SIZE~0)} {6249#true} #45#return; {6257#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:08,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {6257#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6257#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:08,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {6257#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6270#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:08,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {6270#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [103] L23-2-->L23-3_primed: Formula: (or (and (<= v_main_~sum~0_In_28 v_main_~sum~0_Out_56) (= v_main_~i~0_Out_56 0) (< v_main_~i~0_Out_56 (+ v_~SIZE~0_In_28 1)) (= v_main_~i~0_Out_56 v_main_~i~0_In_28)) (and (= v_main_~sum~0_In_28 v_main_~sum~0_Out_56) (= v_~SIZE~0_In_28 v_~SIZE~0_In_28) (= v_main_~i~0_In_28 v_main_~i~0_Out_56))) InVars {~SIZE~0=v_~SIZE~0_In_28, main_~i~0=v_main_~i~0_In_28, main_~sum~0=v_main_~sum~0_In_28} OutVars{~SIZE~0=v_~SIZE~0_In_28, main_~i~0=v_main_~i~0_Out_56, main_~sum~0=v_main_~sum~0_Out_56} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {6270#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:08,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {6270#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [102] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {6250#false} is VALID [2022-04-15 13:11:08,056 INFO L272 TraceCheckUtils]: 8: Hoare triple {6250#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6250#false} is VALID [2022-04-15 13:11:08,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {6250#false} ~cond := #in~cond; {6250#false} is VALID [2022-04-15 13:11:08,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {6250#false} assume 0 == ~cond; {6250#false} is VALID [2022-04-15 13:11:08,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {6250#false} assume !false; {6250#false} is VALID [2022-04-15 13:11:08,056 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:11:08,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:11:08,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:08,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519281610] [2022-04-15 13:11:08,057 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:11:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117254440] [2022-04-15 13:11:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117254440] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:08,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:08,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:09,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:09,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [68014854] [2022-04-15 13:11:09,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [68014854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:09,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:09,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:11:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618457843] [2022-04-15 13:11:09,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:09,307 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 13:11:09,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:09,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:09,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:09,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:11:09,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:09,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:11:09,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:11:09,347 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:11,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:11,050 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:11:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:11:11,050 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 13:11:11,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 13:11:11,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-15 13:11:11,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-15 13:11:11,091 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:11:11,092 INFO L225 Difference]: With dead ends: 46 [2022-04-15 13:11:11,092 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 13:11:11,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2022-04-15 13:11:11,093 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:11,093 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 13:11:11,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 13:11:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-15 13:11:11,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:11,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,126 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,126 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:11,126 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:11:11,126 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:11:11,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:11,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:11,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 13:11:11,127 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 13:11:11,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:11,127 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-15 13:11:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:11:11,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:11,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:11,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:11,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:11,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-15 13:11:11,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-15 13:11:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:11,128 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-15 13:11:11,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:11,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-15 13:11:11,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:11,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-15 13:11:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:11:11,173 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:11,173 INFO L499 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:11,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 13:11:11,373 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 13:11:11,373 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash -645735470, now seen corresponding path program 29 times [2022-04-15 13:11:11,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:11,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1619635396] [2022-04-15 13:11:11,564 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:11,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1468374445, now seen corresponding path program 1 times [2022-04-15 13:11:11,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:11,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609096576] [2022-04-15 13:11:11,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:11,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:11,571 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:11:11,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210112775] [2022-04-15 13:11:11,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:11,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:11,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:11:11,572 INFO L229 MonitoredProcess]: Starting monitored process 31 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:11:11,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 13:11:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:11,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:11:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:11,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:11:11,663 INFO L272 TraceCheckUtils]: 0: Hoare triple {6572#true} call ULTIMATE.init(); {6572#true} is VALID [2022-04-15 13:11:11,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {6572#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);~SIZE~0 := 40000; {6580#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:11,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {6580#(<= 40000 ~SIZE~0)} assume true; {6580#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:11,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6580#(<= 40000 ~SIZE~0)} {6572#true} #45#return; {6580#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:11,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {6580#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6580#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:11,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {6580#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6593#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:11,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {6593#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [105] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_58 v_main_~i~0_In_29) (< v_main_~i~0_Out_58 (+ v_~SIZE~0_In_29 1)) (= v_main_~i~0_Out_58 0) (<= v_main_~sum~0_In_29 v_main_~sum~0_Out_58)) (and (= v_~SIZE~0_In_29 v_~SIZE~0_In_29) (= v_main_~i~0_In_29 v_main_~i~0_Out_58) (= v_main_~sum~0_In_29 v_main_~sum~0_Out_58))) InVars {~SIZE~0=v_~SIZE~0_In_29, main_~i~0=v_main_~i~0_In_29, main_~sum~0=v_main_~sum~0_In_29} OutVars{~SIZE~0=v_~SIZE~0_In_29, main_~i~0=v_main_~i~0_Out_58, main_~sum~0=v_main_~sum~0_Out_58} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {6593#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:11,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {6593#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [104] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {6573#false} is VALID [2022-04-15 13:11:11,669 INFO L272 TraceCheckUtils]: 8: Hoare triple {6573#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6573#false} is VALID [2022-04-15 13:11:11,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {6573#false} ~cond := #in~cond; {6573#false} is VALID [2022-04-15 13:11:11,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {6573#false} assume 0 == ~cond; {6573#false} is VALID [2022-04-15 13:11:11,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {6573#false} assume !false; {6573#false} is VALID [2022-04-15 13:11:11,669 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:11:11,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:11:11,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609096576] [2022-04-15 13:11:11,669 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:11:11,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210112775] [2022-04-15 13:11:11,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210112775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:11,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:11,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:13,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:13,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1619635396] [2022-04-15 13:11:13,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1619635396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:13,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:13,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:11:13,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060814077] [2022-04-15 13:11:13,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:13,023 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 13:11:13,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:13,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:13,057 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:11:13,057 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:11:13,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:11:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 13:11:13,058 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:20,182 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:24,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:24,223 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:11:24,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 13:11:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-15 13:11:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 13:11:24,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-15 13:11:24,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-15 13:11:24,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:24,265 INFO L225 Difference]: With dead ends: 47 [2022-04-15 13:11:24,265 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 13:11:24,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 13:11:24,266 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:24,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 66 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-04-15 13:11:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 13:11:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 13:11:24,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:24,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,308 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,309 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:24,309 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:11:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:11:24,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:24,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:24,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 13:11:24,310 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-15 13:11:24,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:24,311 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-15 13:11:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:11:24,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:24,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:24,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:24,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-15 13:11:24,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-15 13:11:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:24,312 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-15 13:11:24,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:24,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-15 13:11:24,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-15 13:11:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:11:24,352 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:24,352 INFO L499 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:24,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 13:11:24,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:24,553 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:24,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:24,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1491531979, now seen corresponding path program 30 times [2022-04-15 13:11:24,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:24,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1725952664] [2022-04-15 13:11:24,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1409269101, now seen corresponding path program 1 times [2022-04-15 13:11:24,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:24,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713830520] [2022-04-15 13:11:24,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:24,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:24,764 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:11:24,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246340601] [2022-04-15 13:11:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:11:24,772 INFO L229 MonitoredProcess]: Starting monitored process 32 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:11:24,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 13:11:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:24,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:11:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:24,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:11:24,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {6902#true} call ULTIMATE.init(); {6902#true} is VALID [2022-04-15 13:11:24,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {6902#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);~SIZE~0 := 40000; {6910#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:24,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {6910#(<= 40000 ~SIZE~0)} assume true; {6910#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:24,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6910#(<= 40000 ~SIZE~0)} {6902#true} #45#return; {6910#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:24,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {6910#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {6910#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:24,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {6910#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {6923#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:11:24,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {6923#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [107] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_30 v_main_~i~0_Out_60) (= v_~SIZE~0_In_30 v_~SIZE~0_In_30) (= v_main_~sum~0_In_30 v_main_~sum~0_Out_60)) (and (= v_main_~i~0_Out_60 0) (= v_main_~i~0_Out_60 v_main_~i~0_In_30) (<= v_main_~sum~0_In_30 v_main_~sum~0_Out_60) (< v_main_~i~0_Out_60 (+ v_~SIZE~0_In_30 1)))) InVars {~SIZE~0=v_~SIZE~0_In_30, main_~i~0=v_main_~i~0_In_30, main_~sum~0=v_main_~sum~0_In_30} OutVars{~SIZE~0=v_~SIZE~0_In_30, main_~i~0=v_main_~i~0_Out_60, main_~sum~0=v_main_~sum~0_Out_60} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {6923#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:11:24,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {6923#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [106] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {6903#false} is VALID [2022-04-15 13:11:24,870 INFO L272 TraceCheckUtils]: 8: Hoare triple {6903#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {6903#false} is VALID [2022-04-15 13:11:24,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {6903#false} ~cond := #in~cond; {6903#false} is VALID [2022-04-15 13:11:24,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {6903#false} assume 0 == ~cond; {6903#false} is VALID [2022-04-15 13:11:24,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {6903#false} assume !false; {6903#false} is VALID [2022-04-15 13:11:24,871 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:11:24,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:11:24,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:24,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713830520] [2022-04-15 13:11:24,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:11:24,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246340601] [2022-04-15 13:11:24,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246340601] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:24,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:24,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:25,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:25,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1725952664] [2022-04-15 13:11:25,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1725952664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:25,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:25,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 13:11:25,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941020834] [2022-04-15 13:11:25,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:25,627 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 13:11:25,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:25,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:25,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:25,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 13:11:25,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:25,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 13:11:25,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:11:25,662 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:49,104 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:51,115 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:11:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:51,138 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:11:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 13:11:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-15 13:11:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 13:11:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-15 13:11:51,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-15 13:11:51,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:51,209 INFO L225 Difference]: With dead ends: 48 [2022-04-15 13:11:51,209 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 13:11:51,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 13:11:51,210 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 31 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:51,210 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 93 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1127 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 13:11:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 13:11:51,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 13:11:51,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:51,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,250 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,250 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:51,251 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:11:51,251 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:11:51,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:51,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:51,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 13:11:51,251 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 13:11:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:51,252 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 13:11:51,252 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:11:51,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:51,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:51,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:51,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 13:11:51,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-15 13:11:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:51,253 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 13:11:51,253 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:51,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 13:11:51,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:51,311 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 13:11:51,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 13:11:51,312 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:51,312 INFO L499 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:51,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 13:11:51,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:51,513 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:51,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:51,513 INFO L85 PathProgramCache]: Analyzing trace with hash -972653838, now seen corresponding path program 31 times [2022-04-15 13:11:51,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:51,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1376896304] [2022-04-15 13:11:51,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163757, now seen corresponding path program 1 times [2022-04-15 13:11:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:51,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171996232] [2022-04-15 13:11:51,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:51,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:11:51,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [263023142] [2022-04-15 13:11:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:51,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:11:51,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:11:51,731 INFO L229 MonitoredProcess]: Starting monitored process 33 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:11:51,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 13:11:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:51,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:11:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:51,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:11:51,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {7239#true} call ULTIMATE.init(); {7239#true} is VALID [2022-04-15 13:11:51,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {7239#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);~SIZE~0 := 40000; {7247#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:51,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {7247#(<= 40000 ~SIZE~0)} assume true; {7247#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:51,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7247#(<= 40000 ~SIZE~0)} {7239#true} #45#return; {7247#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:51,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {7247#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7247#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:11:51,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {7247#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:51,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {7260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [109] L23-2-->L23-3_primed: Formula: (or (and (= v_~SIZE~0_In_31 v_~SIZE~0_In_31) (= v_main_~sum~0_In_31 v_main_~sum~0_Out_62) (= v_main_~i~0_In_31 v_main_~i~0_Out_62)) (and (< v_main_~i~0_Out_62 (+ v_~SIZE~0_In_31 1)) (<= v_main_~sum~0_In_31 v_main_~sum~0_Out_62) (= v_main_~i~0_Out_62 0) (= v_main_~i~0_Out_62 v_main_~i~0_In_31))) InVars {~SIZE~0=v_~SIZE~0_In_31, main_~i~0=v_main_~i~0_In_31, main_~sum~0=v_main_~sum~0_In_31} OutVars{~SIZE~0=v_~SIZE~0_In_31, main_~i~0=v_main_~i~0_Out_62, main_~sum~0=v_main_~sum~0_Out_62} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {7260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:11:51,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {7260#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [108] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {7240#false} is VALID [2022-04-15 13:11:51,832 INFO L272 TraceCheckUtils]: 8: Hoare triple {7240#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7240#false} is VALID [2022-04-15 13:11:51,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {7240#false} ~cond := #in~cond; {7240#false} is VALID [2022-04-15 13:11:51,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {7240#false} assume 0 == ~cond; {7240#false} is VALID [2022-04-15 13:11:51,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {7240#false} assume !false; {7240#false} is VALID [2022-04-15 13:11:51,833 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:11:51,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:11:51,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:51,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171996232] [2022-04-15 13:11:51,833 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:11:51,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263023142] [2022-04-15 13:11:51,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263023142] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:51,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:51,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:11:53,388 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:53,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1376896304] [2022-04-15 13:11:53,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1376896304] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:53,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:53,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 13:11:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602786932] [2022-04-15 13:11:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:53,389 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 13:11:53,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:53,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:53,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:53,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 13:11:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 13:11:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:11:53,429 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:56,608 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:12:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:00,952 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:12:00,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 13:12:00,953 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 13:12:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:12:00,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:00,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 13:12:00,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-15 13:12:00,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-15 13:12:00,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:01,000 INFO L225 Difference]: With dead ends: 49 [2022-04-15 13:12:01,000 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 13:12:01,001 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 13:12:01,001 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 33 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:12:01,001 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 58 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 13:12:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 13:12:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 13:12:01,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:12:01,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:01,036 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:01,036 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:01,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:01,037 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:12:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:12:01,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:01,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:01,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 13:12:01,037 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-15 13:12:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:01,038 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-15 13:12:01,038 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:12:01,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:01,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:01,038 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:12:01,038 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:12:01,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-15 13:12:01,039 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-15 13:12:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:12:01,039 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-15 13:12:01,039 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:01,039 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-15 13:12:01,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:01,090 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-15 13:12:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 13:12:01,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:01,091 INFO L499 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:12:01,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 13:12:01,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:12:01,291 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:01,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash -53002837, now seen corresponding path program 32 times [2022-04-15 13:12:01,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:01,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052068347] [2022-04-15 13:12:01,525 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:12:01,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1291058413, now seen corresponding path program 1 times [2022-04-15 13:12:01,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:01,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119089002] [2022-04-15 13:12:01,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:01,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:01,532 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:12:01,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364067216] [2022-04-15 13:12:01,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:01,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:12:01,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:12:01,536 INFO L229 MonitoredProcess]: Starting monitored process 34 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:12:01,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 13:12:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:01,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:12:01,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:01,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:12:01,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {7583#true} call ULTIMATE.init(); {7583#true} is VALID [2022-04-15 13:12:01,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {7583#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);~SIZE~0 := 40000; {7591#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:01,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {7591#(<= 40000 ~SIZE~0)} assume true; {7591#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:01,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7591#(<= 40000 ~SIZE~0)} {7583#true} #45#return; {7591#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:01,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {7591#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7591#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:01,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {7591#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7604#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:12:01,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {7604#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [111] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_32 v_main_~i~0_Out_64) (= v_main_~sum~0_In_32 v_main_~sum~0_Out_64) (= v_~SIZE~0_In_32 v_~SIZE~0_In_32)) (and (<= v_main_~sum~0_In_32 v_main_~sum~0_Out_64) (= v_main_~i~0_Out_64 0) (= v_main_~i~0_Out_64 v_main_~i~0_In_32) (< v_main_~i~0_Out_64 (+ v_~SIZE~0_In_32 1)))) InVars {~SIZE~0=v_~SIZE~0_In_32, main_~i~0=v_main_~i~0_In_32, main_~sum~0=v_main_~sum~0_In_32} OutVars{~SIZE~0=v_~SIZE~0_In_32, main_~i~0=v_main_~i~0_Out_64, main_~sum~0=v_main_~sum~0_Out_64} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {7604#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:12:01,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {7604#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [110] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {7584#false} is VALID [2022-04-15 13:12:01,634 INFO L272 TraceCheckUtils]: 8: Hoare triple {7584#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7584#false} is VALID [2022-04-15 13:12:01,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {7584#false} ~cond := #in~cond; {7584#false} is VALID [2022-04-15 13:12:01,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {7584#false} assume 0 == ~cond; {7584#false} is VALID [2022-04-15 13:12:01,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {7584#false} assume !false; {7584#false} is VALID [2022-04-15 13:12:01,634 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:12:01,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:12:01,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:12:01,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119089002] [2022-04-15 13:12:01,634 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:12:01,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364067216] [2022-04-15 13:12:01,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364067216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:01,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:01,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:12:02,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:02,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052068347] [2022-04-15 13:12:02,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052068347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:02,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:02,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 13:12:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251630955] [2022-04-15 13:12:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:02,486 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 13:12:02,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:02,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:02,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:02,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 13:12:02,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 13:12:02,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:12:02,522 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:30,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:12:37,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:12:39,998 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:12:48,047 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:12:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,101 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:12:50,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 13:12:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-15 13:12:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:12:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 13:12:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-15 13:12:50,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-15 13:12:50,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:50,167 INFO L225 Difference]: With dead ends: 50 [2022-04-15 13:12:50,167 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 13:12:50,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 13:12:50,167 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 33 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:12:50,167 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 1321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1284 Invalid, 4 Unknown, 0 Unchecked, 10.4s Time] [2022-04-15 13:12:50,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 13:12:50,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-15 13:12:50,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:12:50,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,200 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,200 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,200 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:12:50,200 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:12:50,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:50,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:50,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 13:12:50,201 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-15 13:12:50,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:50,201 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-15 13:12:50,201 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:12:50,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:50,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:50,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:12:50,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:12:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-15 13:12:50,202 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-15 13:12:50,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:12:50,202 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-15 13:12:50,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:50,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-15 13:12:50,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:50,271 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-15 13:12:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-15 13:12:50,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:50,272 INFO L499 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:12:50,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 13:12:50,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 13:12:50,472 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:50,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1608592878, now seen corresponding path program 33 times [2022-04-15 13:12:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:50,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1699447367] [2022-04-15 13:12:50,663 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:12:50,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1231953069, now seen corresponding path program 1 times [2022-04-15 13:12:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:50,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415088331] [2022-04-15 13:12:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:50,669 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:12:50,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [482757106] [2022-04-15 13:12:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:50,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:12:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:12:50,670 INFO L229 MonitoredProcess]: Starting monitored process 35 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:12:50,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 13:12:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:50,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:12:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:50,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:12:50,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {7934#true} call ULTIMATE.init(); {7934#true} is VALID [2022-04-15 13:12:50,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {7934#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);~SIZE~0 := 40000; {7942#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:50,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {7942#(<= 40000 ~SIZE~0)} assume true; {7942#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:50,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7942#(<= 40000 ~SIZE~0)} {7934#true} #45#return; {7942#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:50,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {7942#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {7942#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:12:50,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {7942#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {7955#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:12:50,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {7955#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [113] L23-2-->L23-3_primed: Formula: (or (and (<= v_main_~sum~0_In_33 v_main_~sum~0_Out_66) (< v_main_~i~0_Out_66 (+ v_~SIZE~0_In_33 1)) (= v_main_~i~0_Out_66 0) (= v_main_~i~0_Out_66 v_main_~i~0_In_33)) (and (= v_~SIZE~0_In_33 v_~SIZE~0_In_33) (= v_main_~sum~0_In_33 v_main_~sum~0_Out_66) (= v_main_~i~0_In_33 v_main_~i~0_Out_66))) InVars {~SIZE~0=v_~SIZE~0_In_33, main_~i~0=v_main_~i~0_In_33, main_~sum~0=v_main_~sum~0_In_33} OutVars{~SIZE~0=v_~SIZE~0_In_33, main_~i~0=v_main_~i~0_Out_66, main_~sum~0=v_main_~sum~0_Out_66} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {7955#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:12:50,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {7955#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [112] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {7935#false} is VALID [2022-04-15 13:12:50,773 INFO L272 TraceCheckUtils]: 8: Hoare triple {7935#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {7935#false} is VALID [2022-04-15 13:12:50,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {7935#false} ~cond := #in~cond; {7935#false} is VALID [2022-04-15 13:12:50,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {7935#false} assume 0 == ~cond; {7935#false} is VALID [2022-04-15 13:12:50,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {7935#false} assume !false; {7935#false} is VALID [2022-04-15 13:12:50,773 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:12:50,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:12:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:12:50,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415088331] [2022-04-15 13:12:50,774 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:12:50,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482757106] [2022-04-15 13:12:50,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482757106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:50,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:50,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:12:52,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:52,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1699447367] [2022-04-15 13:12:52,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1699447367] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:52,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:52,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 13:12:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933192348] [2022-04-15 13:12:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:52,671 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 13:12:52,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:52,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:52,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:52,715 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 13:12:52,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:52,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 13:12:52,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:12:52,717 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:56,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:01,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,448 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:13:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 13:13:01,448 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-15 13:13:01,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 13:13:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-15 13:13:01,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-15 13:13:01,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:01,527 INFO L225 Difference]: With dead ends: 51 [2022-04-15 13:13:01,527 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 13:13:01,528 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:13:01,529 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 37 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:01,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 39 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 65 Invalid, 1 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 13:13:01,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 13:13:01,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-15 13:13:01,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:01,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,574 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,574 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:13:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:13:01,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:01,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:01,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 13:13:01,575 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-15 13:13:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:01,575 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-15 13:13:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:13:01,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:01,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:01,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:01,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:01,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-15 13:13:01,579 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-15 13:13:01,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:01,579 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-15 13:13:01,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:01,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-15 13:13:01,652 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:13:01,652 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-15 13:13:01,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 13:13:01,653 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:01,653 INFO L499 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:01,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 13:13:01,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:01,854 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:01,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1707723403, now seen corresponding path program 34 times [2022-04-15 13:13:01,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:01,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [297258151] [2022-04-15 13:13:02,075 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:02,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1172847725, now seen corresponding path program 1 times [2022-04-15 13:13:02,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:02,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411111299] [2022-04-15 13:13:02,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:02,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:02,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:13:02,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [880349489] [2022-04-15 13:13:02,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:02,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:02,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:02,082 INFO L229 MonitoredProcess]: Starting monitored process 36 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:13:02,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 13:13:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:02,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:13:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:02,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:02,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {8292#true} call ULTIMATE.init(); {8292#true} is VALID [2022-04-15 13:13:02,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {8292#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);~SIZE~0 := 40000; {8300#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:02,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {8300#(<= 40000 ~SIZE~0)} assume true; {8300#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:02,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8300#(<= 40000 ~SIZE~0)} {8292#true} #45#return; {8300#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:02,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {8300#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8300#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:02,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {8300#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8313#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:13:02,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {8313#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [115] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_68 v_main_~i~0_In_34) (< v_main_~i~0_Out_68 (+ v_~SIZE~0_In_34 1)) (<= v_main_~sum~0_In_34 v_main_~sum~0_Out_68) (= v_main_~i~0_Out_68 0)) (and (= v_~SIZE~0_In_34 v_~SIZE~0_In_34) (= v_main_~sum~0_In_34 v_main_~sum~0_Out_68) (= v_main_~i~0_In_34 v_main_~i~0_Out_68))) InVars {~SIZE~0=v_~SIZE~0_In_34, main_~i~0=v_main_~i~0_In_34, main_~sum~0=v_main_~sum~0_In_34} OutVars{~SIZE~0=v_~SIZE~0_In_34, main_~i~0=v_main_~i~0_Out_68, main_~sum~0=v_main_~sum~0_Out_68} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {8313#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:13:02,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {8313#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [114] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {8293#false} is VALID [2022-04-15 13:13:02,182 INFO L272 TraceCheckUtils]: 8: Hoare triple {8293#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8293#false} is VALID [2022-04-15 13:13:02,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {8293#false} ~cond := #in~cond; {8293#false} is VALID [2022-04-15 13:13:02,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {8293#false} assume 0 == ~cond; {8293#false} is VALID [2022-04-15 13:13:02,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {8293#false} assume !false; {8293#false} is VALID [2022-04-15 13:13:02,183 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:13:02,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:13:02,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411111299] [2022-04-15 13:13:02,183 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:13:02,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880349489] [2022-04-15 13:13:02,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880349489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:02,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:02,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:04,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:04,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [297258151] [2022-04-15 13:13:04,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [297258151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:04,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:04,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 13:13:04,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574931416] [2022-04-15 13:13:04,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:04,241 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 13:13:04,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:04,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:04,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:04,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 13:13:04,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:04,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 13:13:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 13:13:04,286 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:12,606 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:13:12,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 13:13:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-15 13:13:12,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 13:13:12,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-15 13:13:12,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-15 13:13:12,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:12,674 INFO L225 Difference]: With dead ends: 52 [2022-04-15 13:13:12,674 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 13:13:12,675 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 13:13:12,675 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:12,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 25 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:13:12,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 13:13:12,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 13:13:12,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:12,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,710 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,710 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:12,710 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:13:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:13:12,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:12,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:12,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:13:12,711 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 13:13:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:12,711 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 13:13:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:13:12,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:12,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:12,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:12,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:12,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 13:13:12,712 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-15 13:13:12,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:12,712 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 13:13:12,712 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:12,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 13:13:12,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 13:13:12,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 13:13:12,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:12,772 INFO L499 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:12,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 13:13:12,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 13:13:12,983 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:12,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:12,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1434313010, now seen corresponding path program 35 times [2022-04-15 13:13:12,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:12,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2029744663] [2022-04-15 13:13:13,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1113742381, now seen corresponding path program 1 times [2022-04-15 13:13:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:13,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598738208] [2022-04-15 13:13:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:13,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:13:13,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662182936] [2022-04-15 13:13:13,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:13,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:13,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:13,177 INFO L229 MonitoredProcess]: Starting monitored process 37 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:13:13,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 13:13:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:13,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:13:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:13,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:13,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {8657#true} call ULTIMATE.init(); {8657#true} is VALID [2022-04-15 13:13:13,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {8657#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);~SIZE~0 := 40000; {8665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:13,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {8665#(<= 40000 ~SIZE~0)} assume true; {8665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:13,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8665#(<= 40000 ~SIZE~0)} {8657#true} #45#return; {8665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:13,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {8665#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {8665#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:13,258 INFO L290 TraceCheckUtils]: 5: Hoare triple {8665#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {8678#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:13:13,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {8678#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [117] L23-2-->L23-3_primed: Formula: (or (and (= v_~SIZE~0_In_35 v_~SIZE~0_In_35) (= v_main_~i~0_In_35 v_main_~i~0_Out_70) (= v_main_~sum~0_In_35 v_main_~sum~0_Out_70)) (and (< v_main_~i~0_Out_70 (+ v_~SIZE~0_In_35 1)) (= v_main_~i~0_Out_70 0) (= v_main_~i~0_Out_70 v_main_~i~0_In_35) (<= v_main_~sum~0_In_35 v_main_~sum~0_Out_70))) InVars {~SIZE~0=v_~SIZE~0_In_35, main_~i~0=v_main_~i~0_In_35, main_~sum~0=v_main_~sum~0_In_35} OutVars{~SIZE~0=v_~SIZE~0_In_35, main_~i~0=v_main_~i~0_Out_70, main_~sum~0=v_main_~sum~0_Out_70} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {8678#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:13:13,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {8678#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [116] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {8658#false} is VALID [2022-04-15 13:13:13,259 INFO L272 TraceCheckUtils]: 8: Hoare triple {8658#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {8658#false} is VALID [2022-04-15 13:13:13,259 INFO L290 TraceCheckUtils]: 9: Hoare triple {8658#false} ~cond := #in~cond; {8658#false} is VALID [2022-04-15 13:13:13,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {8658#false} assume 0 == ~cond; {8658#false} is VALID [2022-04-15 13:13:13,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {8658#false} assume !false; {8658#false} is VALID [2022-04-15 13:13:13,259 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:13:13,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:13:13,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598738208] [2022-04-15 13:13:13,259 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:13:13,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662182936] [2022-04-15 13:13:13,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662182936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:13,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:13,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:14,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2029744663] [2022-04-15 13:13:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2029744663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:14,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 13:13:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914072990] [2022-04-15 13:13:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 13:13:14,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:14,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:14,292 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:13:14,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 13:13:14,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:14,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 13:13:14,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:13:14,293 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:27,327 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:29,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:31,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:33,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:35,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:37,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:39,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:39,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:39,960 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 13:13:39,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 13:13:39,961 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 13:13:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:39,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 13:13:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:39,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-15 13:13:39,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-15 13:13:40,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:40,026 INFO L225 Difference]: With dead ends: 53 [2022-04-15 13:13:40,026 INFO L226 Difference]: Without dead ends: 48 [2022-04-15 13:13:40,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:13:40,026 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1477 mSolverCounterSat, 36 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1477 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:40,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 82 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1477 Invalid, 8 Unknown, 0 Unchecked, 20.4s Time] [2022-04-15 13:13:40,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-15 13:13:40,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-15 13:13:40,066 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:40,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:40,066 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:40,066 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:40,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:40,066 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:13:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:13:40,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:40,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:40,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 13:13:40,067 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-15 13:13:40,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:40,068 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-15 13:13:40,068 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:13:40,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:40,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:40,068 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:40,068 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-15 13:13:40,069 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-15 13:13:40,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:40,069 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-15 13:13:40,069 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:40,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-15 13:13:40,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:40,121 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-15 13:13:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 13:13:40,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:40,121 INFO L499 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:40,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-15 13:13:40,321 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:40,322 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:40,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:40,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1548525419, now seen corresponding path program 36 times [2022-04-15 13:13:40,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:40,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [797793810] [2022-04-15 13:13:40,530 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:13:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1054637037, now seen corresponding path program 1 times [2022-04-15 13:13:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:13:40,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993560131] [2022-04-15 13:13:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:13:40,536 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:13:40,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [834414403] [2022-04-15 13:13:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:13:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:13:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:13:40,538 INFO L229 MonitoredProcess]: Starting monitored process 38 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:13:40,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 13:13:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:40,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:13:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:13:40,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:13:40,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {9029#true} call ULTIMATE.init(); {9029#true} is VALID [2022-04-15 13:13:40,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {9029#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);~SIZE~0 := 40000; {9037#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:40,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {9037#(<= 40000 ~SIZE~0)} assume true; {9037#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:40,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9037#(<= 40000 ~SIZE~0)} {9029#true} #45#return; {9037#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:40,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {9037#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9037#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:13:40,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {9037#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9050#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:13:40,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {9050#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [119] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_36 v_main_~sum~0_Out_72) (= v_~SIZE~0_In_36 v_~SIZE~0_In_36) (= v_main_~i~0_In_36 v_main_~i~0_Out_72)) (and (= v_main_~i~0_Out_72 v_main_~i~0_In_36) (< v_main_~i~0_Out_72 (+ v_~SIZE~0_In_36 1)) (= v_main_~i~0_Out_72 0) (<= v_main_~sum~0_In_36 v_main_~sum~0_Out_72))) InVars {~SIZE~0=v_~SIZE~0_In_36, main_~i~0=v_main_~i~0_In_36, main_~sum~0=v_main_~sum~0_In_36} OutVars{~SIZE~0=v_~SIZE~0_In_36, main_~i~0=v_main_~i~0_Out_72, main_~sum~0=v_main_~sum~0_Out_72} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {9050#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:13:40,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {9050#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [118] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {9030#false} is VALID [2022-04-15 13:13:40,626 INFO L272 TraceCheckUtils]: 8: Hoare triple {9030#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9030#false} is VALID [2022-04-15 13:13:40,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {9030#false} ~cond := #in~cond; {9030#false} is VALID [2022-04-15 13:13:40,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {9030#false} assume 0 == ~cond; {9030#false} is VALID [2022-04-15 13:13:40,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {9030#false} assume !false; {9030#false} is VALID [2022-04-15 13:13:40,626 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:13:40,626 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:13:40,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:13:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993560131] [2022-04-15 13:13:40,627 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:13:40,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834414403] [2022-04-15 13:13:40,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834414403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:40,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:40,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:13:41,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:13:41,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [797793810] [2022-04-15 13:13:41,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [797793810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:13:41,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:13:41,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:13:41,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689635522] [2022-04-15 13:13:41,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:13:41,487 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 13:13:41,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:13:41,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:41,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:41,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:13:41,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:41,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:13:41,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:13:41,539 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:54,594 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:13:58,636 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:00,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:02,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:04,666 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:06,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:08,680 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:10,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:12,697 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:14,705 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:16,713 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:18,720 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:20,729 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:22,734 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:24,758 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:26,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:28,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:30,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:32,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:34,952 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:36,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:38,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:40,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:42,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:44,978 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:46,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:48,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:50,990 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:52,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:54,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:14:55,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:55,034 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 13:14:55,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:14:55,034 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-15 13:14:55,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:14:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 13:14:55,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-15 13:14:55,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-15 13:14:55,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:55,104 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:14:55,104 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 13:14:55,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=1446, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 13:14:55,105 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 37 mSolverCounterUnsat, 30 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 30 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:14:55,105 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 179 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1557 Invalid, 30 Unknown, 0 Unchecked, 64.5s Time] [2022-04-15 13:14:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 13:14:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 13:14:55,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:14:55,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,141 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,142 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:55,142 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:14:55,142 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:14:55,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:55,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:55,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 13:14:55,143 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-15 13:14:55,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:14:55,143 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-15 13:14:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:14:55,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:14:55,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:14:55,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:14:55,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:14:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-15 13:14:55,144 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-15 13:14:55,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:14:55,145 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-15 13:14:55,145 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:55,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-15 13:14:55,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-15 13:14:55,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 13:14:55,237 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:14:55,237 INFO L499 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:14:55,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 13:14:55,437 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 13:14:55,438 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:14:55,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:14:55,438 INFO L85 PathProgramCache]: Analyzing trace with hash 794142802, now seen corresponding path program 37 times [2022-04-15 13:14:55,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:55,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827749586] [2022-04-15 13:14:55,637 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:14:55,638 INFO L85 PathProgramCache]: Analyzing trace with hash -995531693, now seen corresponding path program 1 times [2022-04-15 13:14:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:14:55,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122738468] [2022-04-15 13:14:55,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:14:55,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:14:55,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [618948627] [2022-04-15 13:14:55,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:14:55,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:14:55,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:14:55,644 INFO L229 MonitoredProcess]: Starting monitored process 39 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:14:55,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 13:14:55,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:55,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:14:55,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:14:55,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:14:55,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {9408#true} call ULTIMATE.init(); {9408#true} is VALID [2022-04-15 13:14:55,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {9408#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);~SIZE~0 := 40000; {9416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:14:55,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {9416#(<= 40000 ~SIZE~0)} assume true; {9416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:14:55,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9416#(<= 40000 ~SIZE~0)} {9408#true} #45#return; {9416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:14:55,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {9416#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:14:55,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {9416#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9429#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:14:55,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {9429#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [121] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_37 v_main_~sum~0_Out_74) (= v_~SIZE~0_In_37 v_~SIZE~0_In_37) (= v_main_~i~0_In_37 v_main_~i~0_Out_74)) (and (= v_main_~i~0_Out_74 0) (= v_main_~i~0_Out_74 v_main_~i~0_In_37) (<= v_main_~sum~0_In_37 v_main_~sum~0_Out_74) (< v_main_~i~0_Out_74 (+ v_~SIZE~0_In_37 1)))) InVars {~SIZE~0=v_~SIZE~0_In_37, main_~i~0=v_main_~i~0_In_37, main_~sum~0=v_main_~sum~0_In_37} OutVars{~SIZE~0=v_~SIZE~0_In_37, main_~i~0=v_main_~i~0_Out_74, main_~sum~0=v_main_~sum~0_Out_74} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {9429#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:14:55,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {9429#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [120] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {9409#false} is VALID [2022-04-15 13:14:55,736 INFO L272 TraceCheckUtils]: 8: Hoare triple {9409#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9409#false} is VALID [2022-04-15 13:14:55,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {9409#false} ~cond := #in~cond; {9409#false} is VALID [2022-04-15 13:14:55,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {9409#false} assume 0 == ~cond; {9409#false} is VALID [2022-04-15 13:14:55,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {9409#false} assume !false; {9409#false} is VALID [2022-04-15 13:14:55,736 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:14:55,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:14:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:14:55,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122738468] [2022-04-15 13:14:55,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:14:55,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618948627] [2022-04-15 13:14:55,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618948627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:55,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:55,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:14:56,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:14:56,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827749586] [2022-04-15 13:14:56,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827749586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:14:56,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:14:56,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 13:14:56,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878227662] [2022-04-15 13:14:56,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:14:56,733 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 13:14:56,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:14:56,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:14:56,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:14:56,786 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 13:14:56,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:14:56,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 13:14:56,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:14:56,787 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:10,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:15:14,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:15:27,438 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:15:52,443 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:15:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:52,507 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 13:15:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 13:15:52,508 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-15 13:15:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:15:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 13:15:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-15 13:15:52,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-15 13:15:52,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:52,586 INFO L225 Difference]: With dead ends: 55 [2022-04-15 13:15:52,586 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 13:15:52,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=1523, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 13:15:52,587 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 1671 mSolverCounterSat, 38 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1671 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:15:52,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 163 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1671 Invalid, 2 Unknown, 0 Unchecked, 14.9s Time] [2022-04-15 13:15:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 13:15:52,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-15 13:15:52,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:15:52,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,634 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,634 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:52,634 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:15:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:15:52,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:52,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:52,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 13:15:52,635 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-15 13:15:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:15:52,635 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-15 13:15:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:15:52,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:15:52,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:15:52,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:15:52,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:15:52,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-15 13:15:52,637 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-15 13:15:52,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:15:52,637 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-15 13:15:52,637 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:52,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-15 13:15:52,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-15 13:15:52,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 13:15:52,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:15:52,724 INFO L499 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:15:52,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 13:15:52,925 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 13:15:52,925 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:15:52,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:15:52,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1116881845, now seen corresponding path program 38 times [2022-04-15 13:15:52,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:52,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433542502] [2022-04-15 13:15:53,131 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:15:53,133 INFO L85 PathProgramCache]: Analyzing trace with hash -936426349, now seen corresponding path program 1 times [2022-04-15 13:15:53,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:15:53,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232551584] [2022-04-15 13:15:53,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:53,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:15:53,137 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:15:53,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763839683] [2022-04-15 13:15:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:15:53,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:15:53,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:15:53,139 INFO L229 MonitoredProcess]: Starting monitored process 40 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:15:53,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 13:15:53,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:53,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:15:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:15:53,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:15:53,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} call ULTIMATE.init(); {9794#true} is VALID [2022-04-15 13:15:53,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#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);~SIZE~0 := 40000; {9802#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:15:53,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {9802#(<= 40000 ~SIZE~0)} assume true; {9802#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:15:53,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9802#(<= 40000 ~SIZE~0)} {9794#true} #45#return; {9802#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:15:53,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {9802#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {9802#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:15:53,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {9802#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {9815#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:15:53,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {9815#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [123] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_38 v_main_~i~0_Out_76) (= v_~SIZE~0_In_38 v_~SIZE~0_In_38) (= v_main_~sum~0_In_38 v_main_~sum~0_Out_76)) (and (<= v_main_~sum~0_In_38 v_main_~sum~0_Out_76) (< v_main_~i~0_Out_76 (+ v_~SIZE~0_In_38 1)) (= v_main_~i~0_Out_76 0) (= v_main_~i~0_Out_76 v_main_~i~0_In_38))) InVars {~SIZE~0=v_~SIZE~0_In_38, main_~i~0=v_main_~i~0_In_38, main_~sum~0=v_main_~sum~0_In_38} OutVars{~SIZE~0=v_~SIZE~0_In_38, main_~i~0=v_main_~i~0_Out_76, main_~sum~0=v_main_~sum~0_Out_76} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {9815#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:15:53,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {9815#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [122] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 13:15:53,239 INFO L272 TraceCheckUtils]: 8: Hoare triple {9795#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {9795#false} is VALID [2022-04-15 13:15:53,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {9795#false} ~cond := #in~cond; {9795#false} is VALID [2022-04-15 13:15:53,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {9795#false} assume 0 == ~cond; {9795#false} is VALID [2022-04-15 13:15:53,239 INFO L290 TraceCheckUtils]: 11: Hoare triple {9795#false} assume !false; {9795#false} is VALID [2022-04-15 13:15:53,239 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:15:53,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:15:53,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:15:53,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232551584] [2022-04-15 13:15:53,239 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:15:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763839683] [2022-04-15 13:15:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763839683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:15:54,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:15:54,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433542502] [2022-04-15 13:15:54,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433542502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:15:54,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:15:54,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 13:15:54,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141681517] [2022-04-15 13:15:54,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:15:54,398 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 13:15:54,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:15:54,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:15:54,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:15:54,454 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 13:15:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:15:54,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 13:15:54,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:15:54,455 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:20,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:16:49,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:16:59,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:59,332 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 13:16:59,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 13:16:59,333 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-15 13:16:59,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:16:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 13:16:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-15 13:16:59,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-15 13:16:59,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:59,415 INFO L225 Difference]: With dead ends: 56 [2022-04-15 13:16:59,415 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 13:16:59,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=1602, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:16:59,416 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 1755 mSolverCounterSat, 39 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1755 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:16:59,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 193 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1755 Invalid, 1 Unknown, 0 Unchecked, 10.0s Time] [2022-04-15 13:16:59,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 13:16:59,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 13:16:59,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:16:59,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,452 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,452 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:59,453 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:16:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:16:59,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:59,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:59,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 13:16:59,453 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 13:16:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:16:59,453 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 13:16:59,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:16:59,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:16:59,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:16:59,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:16:59,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:16:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 13:16:59,454 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-15 13:16:59,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:16:59,455 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 13:16:59,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:16:59,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 13:16:59,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:16:59,528 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 13:16:59,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 13:16:59,528 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:16:59,528 INFO L499 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:16:59,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 13:16:59,728 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 13:16:59,728 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:16:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:16:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash -229103758, now seen corresponding path program 39 times [2022-04-15 13:16:59,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:16:59,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [862664800] [2022-04-15 13:16:59,910 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:16:59,911 INFO L85 PathProgramCache]: Analyzing trace with hash -877321005, now seen corresponding path program 1 times [2022-04-15 13:16:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:16:59,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656995323] [2022-04-15 13:16:59,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:16:59,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:16:59,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2046147524] [2022-04-15 13:16:59,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:16:59,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:16:59,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:16:59,926 INFO L229 MonitoredProcess]: Starting monitored process 41 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:16:59,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 13:16:59,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:59,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:16:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:16:59,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:00,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {10187#true} call ULTIMATE.init(); {10187#true} is VALID [2022-04-15 13:17:00,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {10187#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);~SIZE~0 := 40000; {10195#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:00,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {10195#(<= 40000 ~SIZE~0)} assume true; {10195#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:00,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10195#(<= 40000 ~SIZE~0)} {10187#true} #45#return; {10195#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:00,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {10195#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10195#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:00,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {10195#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10208#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:17:00,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {10208#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [125] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_Out_78 0) (= v_main_~i~0_Out_78 v_main_~i~0_In_39) (< v_main_~i~0_Out_78 (+ v_~SIZE~0_In_39 1)) (<= v_main_~sum~0_In_39 v_main_~sum~0_Out_78)) (and (= v_main_~sum~0_In_39 v_main_~sum~0_Out_78) (= v_main_~i~0_In_39 v_main_~i~0_Out_78) (= v_~SIZE~0_In_39 v_~SIZE~0_In_39))) InVars {~SIZE~0=v_~SIZE~0_In_39, main_~i~0=v_main_~i~0_In_39, main_~sum~0=v_main_~sum~0_In_39} OutVars{~SIZE~0=v_~SIZE~0_In_39, main_~i~0=v_main_~i~0_Out_78, main_~sum~0=v_main_~sum~0_Out_78} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {10208#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:17:00,043 INFO L290 TraceCheckUtils]: 7: Hoare triple {10208#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [124] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {10188#false} is VALID [2022-04-15 13:17:00,043 INFO L272 TraceCheckUtils]: 8: Hoare triple {10188#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10188#false} is VALID [2022-04-15 13:17:00,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {10188#false} ~cond := #in~cond; {10188#false} is VALID [2022-04-15 13:17:00,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {10188#false} assume 0 == ~cond; {10188#false} is VALID [2022-04-15 13:17:00,043 INFO L290 TraceCheckUtils]: 11: Hoare triple {10188#false} assume !false; {10188#false} is VALID [2022-04-15 13:17:00,043 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:00,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:00,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656995323] [2022-04-15 13:17:00,043 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:17:00,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046147524] [2022-04-15 13:17:00,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2046147524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:00,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:00,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:17:03,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:03,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [862664800] [2022-04-15 13:17:03,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [862664800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:03,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:03,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 13:17:03,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511450371] [2022-04-15 13:17:03,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 13:17:03,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:03,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:03,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:03,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 13:17:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 13:17:03,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:17:03,156 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:13,616 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-15 13:17:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 13:17:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 13:17:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:17:13,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 13:17:13,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-15 13:17:13,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-15 13:17:13,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:13,690 INFO L225 Difference]: With dead ends: 57 [2022-04-15 13:17:13,690 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:17:13,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 13:17:13,691 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:17:13,691 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 30 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:17:13,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:17:13,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 13:17:13,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:17:13,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,732 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,732 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:13,733 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:17:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:17:13,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:13,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:13,733 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 13:17:13,733 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-15 13:17:13,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:17:13,734 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-15 13:17:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:17:13,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:17:13,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:17:13,734 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:17:13,734 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:17:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-15 13:17:13,735 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-15 13:17:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:17:13,735 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-15 13:17:13,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:13,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-15 13:17:13,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-15 13:17:13,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 13:17:13,822 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:17:13,822 INFO L499 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:17:13,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 13:17:14,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 13:17:14,043 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:17:14,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:17:14,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1522213163, now seen corresponding path program 40 times [2022-04-15 13:17:14,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:14,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1612101146] [2022-04-15 13:17:14,226 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:17:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash -818215661, now seen corresponding path program 1 times [2022-04-15 13:17:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:17:14,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448157783] [2022-04-15 13:17:14,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:17:14,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:17:14,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967021860] [2022-04-15 13:17:14,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:17:14,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:17:14,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:17:14,233 INFO L229 MonitoredProcess]: Starting monitored process 42 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:14,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 13:17:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:14,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:17:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:17:14,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:17:14,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {10587#true} call ULTIMATE.init(); {10587#true} is VALID [2022-04-15 13:17:14,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {10587#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);~SIZE~0 := 40000; {10595#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:14,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {10595#(<= 40000 ~SIZE~0)} assume true; {10595#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:14,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10595#(<= 40000 ~SIZE~0)} {10587#true} #45#return; {10595#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:14,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {10595#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {10595#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:17:14,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {10595#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {10608#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:17:14,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {10608#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [127] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_40 v_main_~sum~0_Out_80) (= v_main_~i~0_In_40 v_main_~i~0_Out_80) (= v_~SIZE~0_In_40 v_~SIZE~0_In_40)) (and (<= v_main_~sum~0_In_40 v_main_~sum~0_Out_80) (< v_main_~i~0_Out_80 (+ v_~SIZE~0_In_40 1)) (= v_main_~i~0_Out_80 v_main_~i~0_In_40) (= v_main_~i~0_Out_80 0))) InVars {~SIZE~0=v_~SIZE~0_In_40, main_~i~0=v_main_~i~0_In_40, main_~sum~0=v_main_~sum~0_In_40} OutVars{~SIZE~0=v_~SIZE~0_In_40, main_~i~0=v_main_~i~0_Out_80, main_~sum~0=v_main_~sum~0_Out_80} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {10608#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:17:14,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {10608#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [126] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {10588#false} is VALID [2022-04-15 13:17:14,315 INFO L272 TraceCheckUtils]: 8: Hoare triple {10588#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10588#false} is VALID [2022-04-15 13:17:14,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {10588#false} ~cond := #in~cond; {10588#false} is VALID [2022-04-15 13:17:14,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {10588#false} assume 0 == ~cond; {10588#false} is VALID [2022-04-15 13:17:14,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {10588#false} assume !false; {10588#false} is VALID [2022-04-15 13:17:14,316 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:14,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:17:14,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:17:14,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448157783] [2022-04-15 13:17:14,316 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:17:14,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967021860] [2022-04-15 13:17:14,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967021860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:14,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:14,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:17:15,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:17:15,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1612101146] [2022-04-15 13:17:15,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1612101146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:17:15,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:17:15,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 13:17:15,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047774344] [2022-04-15 13:17:15,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:17:15,595 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 13:17:15,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:17:15,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:15,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:17:15,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 13:17:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:17:15,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 13:17:15,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:17:15,655 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:17:54,945 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:01,628 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:03,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:05,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:07,669 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:09,674 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:11,679 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:13,683 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:15,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:17,712 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:19,715 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:21,732 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:23,736 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:25,740 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:27,754 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:29,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:31,766 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:33,784 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:35,788 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:37,794 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:37,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,850 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-15 13:18:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 13:18:37,850 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-15 13:18:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 13:18:37,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-15 13:18:37,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-15 13:18:37,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:37,933 INFO L225 Difference]: With dead ends: 58 [2022-04-15 13:18:37,933 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 13:18:37,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 13:18:37,934 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 1909 mSolverCounterSat, 41 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1909 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:37,934 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 188 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1909 Invalid, 19 Unknown, 0 Unchecked, 49.1s Time] [2022-04-15 13:18:37,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 13:18:37,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 13:18:37,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:37,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,974 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,974 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,974 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 13:18:37,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 13:18:37,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:18:37,975 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:18:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:37,975 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-15 13:18:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 13:18:37,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:37,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:37,976 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:37,976 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-15 13:18:37,976 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-15 13:18:37,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:37,977 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-15 13:18:37,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:37,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-15 13:18:38,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:38,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-15 13:18:38,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 13:18:38,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:38,111 INFO L499 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:38,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 13:18:38,311 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:38,311 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:38,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -21537134, now seen corresponding path program 41 times [2022-04-15 13:18:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:38,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373181503] [2022-04-15 13:18:38,517 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -759110317, now seen corresponding path program 1 times [2022-04-15 13:18:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:38,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866861792] [2022-04-15 13:18:38,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:38,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:38,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:38,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1849411990] [2022-04-15 13:18:38,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:38,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:38,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:38,525 INFO L229 MonitoredProcess]: Starting monitored process 43 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:38,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 13:18:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:18:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:38,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:38,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {10994#true} call ULTIMATE.init(); {10994#true} is VALID [2022-04-15 13:18:38,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {10994#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);~SIZE~0 := 40000; {11002#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:38,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {11002#(<= 40000 ~SIZE~0)} assume true; {11002#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:38,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11002#(<= 40000 ~SIZE~0)} {10994#true} #45#return; {11002#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:38,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {11002#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {11002#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:38,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {11002#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11015#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:18:38,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {11015#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [129] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~i~0_In_41 v_main_~i~0_Out_82) (= v_~SIZE~0_In_41 v_~SIZE~0_In_41) (= v_main_~sum~0_In_41 v_main_~sum~0_Out_82)) (and (< v_main_~i~0_Out_82 (+ v_~SIZE~0_In_41 1)) (<= v_main_~sum~0_In_41 v_main_~sum~0_Out_82) (= v_main_~i~0_Out_82 0) (= v_main_~i~0_Out_82 v_main_~i~0_In_41))) InVars {~SIZE~0=v_~SIZE~0_In_41, main_~i~0=v_main_~i~0_In_41, main_~sum~0=v_main_~sum~0_In_41} OutVars{~SIZE~0=v_~SIZE~0_In_41, main_~i~0=v_main_~i~0_Out_82, main_~sum~0=v_main_~sum~0_Out_82} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {11015#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:18:38,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {11015#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [128] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {10995#false} is VALID [2022-04-15 13:18:38,638 INFO L272 TraceCheckUtils]: 8: Hoare triple {10995#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {10995#false} is VALID [2022-04-15 13:18:38,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {10995#false} ~cond := #in~cond; {10995#false} is VALID [2022-04-15 13:18:38,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {10995#false} assume 0 == ~cond; {10995#false} is VALID [2022-04-15 13:18:38,639 INFO L290 TraceCheckUtils]: 11: Hoare triple {10995#false} assume !false; {10995#false} is VALID [2022-04-15 13:18:38,639 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:18:38,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:38,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866861792] [2022-04-15 13:18:38,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:38,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849411990] [2022-04-15 13:18:38,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849411990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:38,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:38,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:18:43,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:43,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373181503] [2022-04-15 13:18:43,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373181503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:43,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:43,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 13:18:43,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696937221] [2022-04-15 13:18:43,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:43,171 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 13:18:43,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:43,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:43,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:43,238 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 13:18:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:43,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 13:18:43,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 13:18:43,240 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,150 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:18:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:46,172 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 13:18:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 13:18:46,172 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-15 13:18:46,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 13:18:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-15 13:18:46,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-15 13:18:46,256 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:18:46,256 INFO L225 Difference]: With dead ends: 59 [2022-04-15 13:18:46,256 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 13:18:46,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 13:18:46,257 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 46 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:46,257 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 13:18:46,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 13:18:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 13:18:46,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:46,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,297 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,297 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:46,298 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 13:18:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 13:18:46,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:46,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 13:18:46,298 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-15 13:18:46,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:46,299 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-15 13:18:46,299 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 13:18:46,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:46,299 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:46,299 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:46,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-15 13:18:46,300 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-15 13:18:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:46,300 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-15 13:18:46,300 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:46,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-15 13:18:46,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-15 13:18:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 13:18:46,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:46,392 INFO L499 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:46,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 13:18:46,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:46,595 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:46,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:46,596 INFO L85 PathProgramCache]: Analyzing trace with hash -633156085, now seen corresponding path program 42 times [2022-04-15 13:18:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:46,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262480557] [2022-04-15 13:18:46,800 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:46,802 INFO L85 PathProgramCache]: Analyzing trace with hash -700004973, now seen corresponding path program 1 times [2022-04-15 13:18:46,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:46,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540043152] [2022-04-15 13:18:46,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:46,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:46,809 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:46,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933899487] [2022-04-15 13:18:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:46,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:46,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:46,811 INFO L229 MonitoredProcess]: Starting monitored process 44 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:46,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 13:18:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:46,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 13:18:46,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:46,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:46,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {11408#true} call ULTIMATE.init(); {11408#true} is VALID [2022-04-15 13:18:46,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {11408#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);~SIZE~0 := 40000; {11416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:46,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {11416#(<= 40000 ~SIZE~0)} assume true; {11416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:46,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11416#(<= 40000 ~SIZE~0)} {11408#true} #45#return; {11416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:46,911 INFO L272 TraceCheckUtils]: 4: Hoare triple {11416#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {11416#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:46,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {11416#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11429#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:18:46,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {11429#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [131] L23-2-->L23-3_primed: Formula: (or (and (< v_main_~i~0_Out_84 (+ v_~SIZE~0_In_42 1)) (= v_main_~i~0_Out_84 0) (= v_main_~i~0_Out_84 v_main_~i~0_In_42) (<= v_main_~sum~0_In_42 v_main_~sum~0_Out_84)) (and (= v_~SIZE~0_In_42 v_~SIZE~0_In_42) (= v_main_~sum~0_In_42 v_main_~sum~0_Out_84) (= v_main_~i~0_In_42 v_main_~i~0_Out_84))) InVars {~SIZE~0=v_~SIZE~0_In_42, main_~i~0=v_main_~i~0_In_42, main_~sum~0=v_main_~sum~0_In_42} OutVars{~SIZE~0=v_~SIZE~0_In_42, main_~i~0=v_main_~i~0_Out_84, main_~sum~0=v_main_~sum~0_Out_84} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {11429#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} is VALID [2022-04-15 13:18:46,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {11429#(and (<= main_~i~0 0) (<= 40000 ~SIZE~0))} [130] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {11409#false} is VALID [2022-04-15 13:18:46,921 INFO L272 TraceCheckUtils]: 8: Hoare triple {11409#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11409#false} is VALID [2022-04-15 13:18:46,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {11409#false} ~cond := #in~cond; {11409#false} is VALID [2022-04-15 13:18:46,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {11409#false} assume 0 == ~cond; {11409#false} is VALID [2022-04-15 13:18:46,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {11409#false} assume !false; {11409#false} is VALID [2022-04-15 13:18:46,921 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:18:46,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540043152] [2022-04-15 13:18:46,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:46,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933899487] [2022-04-15 13:18:46,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933899487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:46,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:46,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:18:52,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:52,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262480557] [2022-04-15 13:18:52,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262480557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:52,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:52,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 13:18:52,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484330858] [2022-04-15 13:18:52,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 13:18:52,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:52,314 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:52,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:52,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 13:18:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 13:18:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:18:52,393 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,288 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-15 13:18:57,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 13:18:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 13:18:57,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:18:57,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 13:18:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-15 13:18:57,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-15 13:18:57,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:57,397 INFO L225 Difference]: With dead ends: 60 [2022-04-15 13:18:57,397 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 13:18:57,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:18:57,398 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:18:57,398 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 13:18:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 13:18:57,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 13:18:57,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:18:57,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,441 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,441 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,442 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 13:18:57,442 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 13:18:57,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:57,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:57,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 13:18:57,443 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 13:18:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:18:57,444 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 13:18:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 13:18:57,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:18:57,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:18:57,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:18:57,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:18:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 13:18:57,445 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-15 13:18:57,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:18:57,445 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 13:18:57,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:57,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 13:18:57,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:57,579 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 13:18:57,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 13:18:57,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:18:57,579 INFO L499 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:18:57,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 13:18:57,780 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 13:18:57,780 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:18:57,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:18:57,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1881492914, now seen corresponding path program 43 times [2022-04-15 13:18:57,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:57,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1914332769] [2022-04-15 13:18:57,996 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:18:57,997 INFO L85 PathProgramCache]: Analyzing trace with hash -640899629, now seen corresponding path program 1 times [2022-04-15 13:18:57,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:18:57,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899557203] [2022-04-15 13:18:57,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:57,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:18:58,001 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:18:58,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [506924493] [2022-04-15 13:18:58,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:18:58,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:18:58,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:18:58,004 INFO L229 MonitoredProcess]: Starting monitored process 45 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:58,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 13:18:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:58,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:18:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:18:58,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:18:58,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {11829#true} call ULTIMATE.init(); {11829#true} is VALID [2022-04-15 13:18:58,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {11829#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);~SIZE~0 := 40000; {11837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:58,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {11837#(<= 40000 ~SIZE~0)} assume true; {11837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:58,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11837#(<= 40000 ~SIZE~0)} {11829#true} #45#return; {11837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:58,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {11837#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {11837#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:18:58,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {11837#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {11850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:18:58,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {11850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [133] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_43 v_main_~sum~0_Out_86) (= v_main_~i~0_In_43 v_main_~i~0_Out_86) (= v_~SIZE~0_In_43 v_~SIZE~0_In_43)) (and (= v_main_~i~0_Out_86 v_main_~i~0_In_43) (< v_main_~i~0_Out_86 (+ v_~SIZE~0_In_43 1)) (<= v_main_~sum~0_In_43 v_main_~sum~0_Out_86) (= v_main_~i~0_Out_86 0))) InVars {~SIZE~0=v_~SIZE~0_In_43, main_~i~0=v_main_~i~0_In_43, main_~sum~0=v_main_~sum~0_In_43} OutVars{~SIZE~0=v_~SIZE~0_In_43, main_~i~0=v_main_~i~0_Out_86, main_~sum~0=v_main_~sum~0_Out_86} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {11850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:18:58,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {11850#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [132] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {11830#false} is VALID [2022-04-15 13:18:58,095 INFO L272 TraceCheckUtils]: 8: Hoare triple {11830#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {11830#false} is VALID [2022-04-15 13:18:58,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {11830#false} ~cond := #in~cond; {11830#false} is VALID [2022-04-15 13:18:58,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {11830#false} assume 0 == ~cond; {11830#false} is VALID [2022-04-15 13:18:58,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {11830#false} assume !false; {11830#false} is VALID [2022-04-15 13:18:58,095 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:18:58,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:18:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:18:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899557203] [2022-04-15 13:18:58,095 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:18:58,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506924493] [2022-04-15 13:18:58,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506924493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:58,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:58,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:18:59,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:18:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1914332769] [2022-04-15 13:18:59,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1914332769] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:18:59,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:18:59,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 13:18:59,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91313337] [2022-04-15 13:18:59,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:18:59,693 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 13:18:59,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:18:59,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:18:59,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:18:59,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 13:18:59,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:18:59,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 13:18:59,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:18:59,780 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:19:37,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:43,073 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:51,582 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:53,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:55,613 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:57,618 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:19:59,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:01,643 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:03,664 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:05,670 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:07,695 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:09,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:11,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:13,749 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:15,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:17,782 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:19,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:21,795 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:23,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:25,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:27,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:30,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:32,763 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:34,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:36,790 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:38,810 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:40,830 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:42,835 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:44,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:46,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:48,888 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 13:20:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:48,935 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-15 13:20:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 13:20:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 13:20:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:20:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 13:20:48,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:48,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-15 13:20:48,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-15 13:20:49,066 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:20:49,067 INFO L225 Difference]: With dead ends: 61 [2022-04-15 13:20:49,067 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:20:49,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:20:49,067 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 44 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:20:49,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 192 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2170 Invalid, 31 Unknown, 0 Unchecked, 75.0s Time] [2022-04-15 13:20:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:20:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 13:20:49,113 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:20:49,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:49,113 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:49,113 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:49,114 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 13:20:49,114 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 13:20:49,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:49,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:49,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 13:20:49,114 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-15 13:20:49,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:20:49,114 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-15 13:20:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 13:20:49,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:20:49,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:20:49,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:20:49,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:20:49,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:49,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-15 13:20:49,115 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-15 13:20:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:20:49,116 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-15 13:20:49,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:49,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-15 13:20:49,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-15 13:20:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 13:20:49,271 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:20:49,271 INFO L499 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:20:49,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-15 13:20:49,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:49,472 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:20:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:20:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1768766741, now seen corresponding path program 44 times [2022-04-15 13:20:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:49,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688560564] [2022-04-15 13:20:49,673 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:20:49,674 INFO L85 PathProgramCache]: Analyzing trace with hash -581794285, now seen corresponding path program 1 times [2022-04-15 13:20:49,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:20:49,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851309252] [2022-04-15 13:20:49,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:49,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:20:49,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:20:49,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904817228] [2022-04-15 13:20:49,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:20:49,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:20:49,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:20:49,688 INFO L229 MonitoredProcess]: Starting monitored process 46 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:20:49,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 13:20:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:49,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:20:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:20:49,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:20:49,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {12257#true} call ULTIMATE.init(); {12257#true} is VALID [2022-04-15 13:20:49,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {12257#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);~SIZE~0 := 40000; {12265#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:20:49,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {12265#(<= 40000 ~SIZE~0)} assume true; {12265#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:20:49,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12265#(<= 40000 ~SIZE~0)} {12257#true} #45#return; {12265#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:20:49,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {12265#(<= 40000 ~SIZE~0)} call #t~ret4 := main(); {12265#(<= 40000 ~SIZE~0)} is VALID [2022-04-15 13:20:49,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {12265#(<= 40000 ~SIZE~0)} havoc ~i~0;havoc ~sum~0;~i~0 := 0;~sum~0 := 0; {12278#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:20:49,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {12278#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [135] L23-2-->L23-3_primed: Formula: (or (and (= v_main_~sum~0_In_44 v_main_~sum~0_Out_88) (= v_~SIZE~0_In_44 v_~SIZE~0_In_44) (= v_main_~i~0_In_44 v_main_~i~0_Out_88)) (and (= v_main_~i~0_Out_88 v_main_~i~0_In_44) (= v_main_~i~0_Out_88 0) (< v_main_~i~0_Out_88 (+ v_~SIZE~0_In_44 1)) (<= v_main_~sum~0_In_44 v_main_~sum~0_Out_88))) InVars {~SIZE~0=v_~SIZE~0_In_44, main_~i~0=v_main_~i~0_In_44, main_~sum~0=v_main_~sum~0_In_44} OutVars{~SIZE~0=v_~SIZE~0_In_44, main_~i~0=v_main_~i~0_Out_88, main_~sum~0=v_main_~sum~0_Out_88} AuxVars[] AssignedVars[main_~sum~0, main_~i~0] {12278#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} is VALID [2022-04-15 13:20:49,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {12278#(and (<= 40000 ~SIZE~0) (= main_~i~0 0))} [134] L23-3_primed-->L23-3: Formula: (not (< v_main_~i~0_1 v_~SIZE~0_1)) InVars {~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} OutVars{~SIZE~0=v_~SIZE~0_1, main_~i~0=v_main_~i~0_1} AuxVars[] AssignedVars[] {12258#false} is VALID [2022-04-15 13:20:49,771 INFO L272 TraceCheckUtils]: 8: Hoare triple {12258#false} call __VERIFIER_assert((if ~sum~0 % 18446744073709551616 == (if ~SIZE~0 * (1 + ~SIZE~0) < 0 && 0 != ~SIZE~0 * (1 + ~SIZE~0) % 2 then 1 + ~SIZE~0 * (1 + ~SIZE~0) / 2 else ~SIZE~0 * (1 + ~SIZE~0) / 2) % 18446744073709551616 then 1 else 0)); {12258#false} is VALID [2022-04-15 13:20:49,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {12258#false} ~cond := #in~cond; {12258#false} is VALID [2022-04-15 13:20:49,771 INFO L290 TraceCheckUtils]: 10: Hoare triple {12258#false} assume 0 == ~cond; {12258#false} is VALID [2022-04-15 13:20:49,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {12258#false} assume !false; {12258#false} is VALID [2022-04-15 13:20:49,771 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:20:49,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:20:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:20:49,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851309252] [2022-04-15 13:20:49,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:20:49,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904817228] [2022-04-15 13:20:49,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904817228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:49,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:20:51,492 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:20:51,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688560564] [2022-04-15 13:20:51,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688560564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:20:51,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:20:51,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 13:20:51,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058443132] [2022-04-15 13:20:51,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:20:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-15 13:20:51,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:20:51,493 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:20:51,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:20:51,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 13:20:51,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:20:51,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 13:20:51,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2118, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 13:20:51,598 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)