/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/sumt6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:09:50,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:09:50,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:09:50,548 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:09:50,549 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:09:50,550 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:09:50,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:09:50,554 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:09:50,555 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:09:50,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:09:50,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:09:50,559 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:09:50,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:09:50,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:09:50,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:09:50,564 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:09:50,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:09:50,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:09:50,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:09:50,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:09:50,572 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:09:50,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:09:50,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:09:50,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:09:50,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:09:50,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:09:50,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:09:50,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:09:50,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:09:50,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:09:50,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:09:50,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:09:50,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:09:50,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:09:50,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:09:50,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:09:50,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:09:50,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:09:50,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:09:50,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:09:50,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:09:50,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:09:50,586 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:09:50,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:09:50,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:09:50,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:09:50,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:09:50,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:09:50,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:09:50,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:09:50,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:09:50,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:09:50,595 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:09:50,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:09:50,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:09:50,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:50,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:09:50,596 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:09:50,596 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:09:50,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:09:50,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:09:50,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:09:50,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:09:50,787 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:09:50,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 13:09:50,843 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859026a5e/14a86219fd6142cea87ab514e86c2605/FLAG11c1f6845 [2022-04-15 13:09:51,224 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:09:51,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c [2022-04-15 13:09:51,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859026a5e/14a86219fd6142cea87ab514e86c2605/FLAG11c1f6845 [2022-04-15 13:09:51,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/859026a5e/14a86219fd6142cea87ab514e86c2605 [2022-04-15 13:09:51,243 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:09:51,244 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:09:51,246 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:51,246 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:09:51,248 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:09:51,249 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fcad148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51, skipping insertion in model container [2022-04-15 13:09:51,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:09:51,264 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:09:51,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/sumt6.c[403,416] [2022-04-15 13:09:51,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:51,449 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:09:51,459 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/sumt6.c[403,416] [2022-04-15 13:09:51,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:09:51,481 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:09:51,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51 WrapperNode [2022-04-15 13:09:51,481 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:09:51,482 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:09:51,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:09:51,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:09:51,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,510 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,515 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,521 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:09:51,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:09:51,523 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:09:51,523 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:09:51,524 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (1/1) ... [2022-04-15 13:09:51,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:09:51,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:51,546 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:09:51,563 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:09:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:09:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:09:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:09:51,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:09:51,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:09:51,580 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:09:51,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:09:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 13:09:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:09:51,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:09:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:09:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:09:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:09:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:09:51,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:09:51,624 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:09:51,625 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:09:58,306 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:09:58,312 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:09:58,312 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:09:58,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:58 BoogieIcfgContainer [2022-04-15 13:09:58,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:09:58,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:09:58,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:09:58,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:09:58,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:09:51" (1/3) ... [2022-04-15 13:09:58,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3429bc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:58, skipping insertion in model container [2022-04-15 13:09:58,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:09:51" (2/3) ... [2022-04-15 13:09:58,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3429bc3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:09:58, skipping insertion in model container [2022-04-15 13:09:58,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:09:58" (3/3) ... [2022-04-15 13:09:58,328 INFO L111 eAbstractionObserver]: Analyzing ICFG sumt6.c [2022-04-15 13:09:58,331 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:09:58,331 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:09:58,360 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:09:58,365 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:09:58,365 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:09:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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:09:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:09:58,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:58,383 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:58,383 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:58,386 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 1 times [2022-04-15 13:09:58,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:58,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1969963054] [2022-04-15 13:09:58,398 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:09:58,398 INFO L85 PathProgramCache]: Analyzing trace with hash 503999003, now seen corresponding path program 2 times [2022-04-15 13:09:58,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:58,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142733752] [2022-04-15 13:09:58,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:58,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:58,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:58,561 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-15 13:09:58,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 13:09:58,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-15 13:09:58,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:58,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {29#true} is VALID [2022-04-15 13:09:58,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 13:09:58,564 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #76#return; {29#true} is VALID [2022-04-15 13:09:58,564 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret5 := main(); {29#true} is VALID [2022-04-15 13:09:58,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {29#true} is VALID [2022-04-15 13:09:58,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {29#true} is VALID [2022-04-15 13:09:58,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-15 13:09:58,565 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-15 13:09:58,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-15 13:09:58,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-15 13:09:58,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 13:09:58,566 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:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:58,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142733752] [2022-04-15 13:09:58,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142733752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:58,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:58,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:09:58,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:58,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1969963054] [2022-04-15 13:09:58,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1969963054] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:58,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:58,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:09:58,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085445426] [2022-04-15 13:09:58,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:09:58,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:58,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:58,589 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:09:58,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:09:58,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:58,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:09:58,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:09:58,618 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:05,270 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 13:10:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:10:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:10:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:05,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 13:10:05,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:05,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 13:10:05,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 13:10:05,326 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:10:05,330 INFO L225 Difference]: With dead ends: 38 [2022-04-15 13:10:05,331 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 13:10:05,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:10:05,334 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:05,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 32 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:10:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 13:10:05,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 13:10:05,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:05,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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:10:05,353 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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:10:05,354 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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:10:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:05,355 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 13:10:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 13:10:05,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:05,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:05,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 19 states. [2022-04-15 13:10:05,356 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 19 states. [2022-04-15 13:10:05,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:05,358 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 13:10:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 13:10:05,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:05,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:05,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:05,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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:10:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 13:10:05,361 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2022-04-15 13:10:05,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:05,361 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 13:10:05,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:05,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 24 transitions. [2022-04-15 13:10:05,385 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:10:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 13:10:05,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:10:05,385 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:05,385 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:05,386 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:10:05,386 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 1 times [2022-04-15 13:10:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:05,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [753214999] [2022-04-15 13:10:05,387 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:10:05,387 INFO L85 PathProgramCache]: Analyzing trace with hash 475369852, now seen corresponding path program 2 times [2022-04-15 13:10:05,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:05,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874093691] [2022-04-15 13:10:05,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:05,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:05,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:10:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:05,654 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {189#true} is VALID [2022-04-15 13:10:05,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-15 13:10:05,654 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-15 13:10:05,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {189#true} call ULTIMATE.init(); {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:10:05,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {189#true} is VALID [2022-04-15 13:10:05,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume true; {189#true} is VALID [2022-04-15 13:10:05,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#true} {189#true} #76#return; {189#true} is VALID [2022-04-15 13:10:05,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#true} call #t~ret5 := main(); {189#true} is VALID [2022-04-15 13:10:05,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:05,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:05,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !(~l~0 % 4294967296 < ~n~0 % 4294967296); {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:05,659 INFO L272 TraceCheckUtils]: 8: Hoare triple {194#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {195#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:10:05,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {195#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {196#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:10:05,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {196#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-04-15 13:10:05,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-04-15 13:10:05,661 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:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:05,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874093691] [2022-04-15 13:10:05,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874093691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:05,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:05,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:10:05,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:05,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [753214999] [2022-04-15 13:10:05,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [753214999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:05,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:05,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:10:05,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398817391] [2022-04-15 13:10:05,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:05,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:10:05,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:05,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:05,672 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:10:05,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:10:05,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:05,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:10:05,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:10:05,674 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:07,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:12,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:20,907 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:23,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:25,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:25,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:25,473 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 13:10:25,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:10:25,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:10:25,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 13:10:25,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:25,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-15 13:10:25,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-15 13:10:25,506 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:10:25,507 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:10:25,507 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 13:10:25,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:10:25,508 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:25,508 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 5 Unknown, 0 Unchecked, 10.7s Time] [2022-04-15 13:10:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 13:10:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2022-04-15 13:10:25,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:25,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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:10:25,513 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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:10:25,513 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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:10:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:25,514 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 13:10:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 13:10:25,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:25,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:25,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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 21 states. [2022-04-15 13:10:25,515 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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 21 states. [2022-04-15 13:10:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:25,516 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-04-15 13:10:25,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-04-15 13:10:25,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:25,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:25,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:25,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 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:10:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-15 13:10:25,518 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 12 [2022-04-15 13:10:25,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:25,518 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-15 13:10:25,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:25,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 25 transitions. [2022-04-15 13:10:25,545 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:10:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-15 13:10:25,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 13:10:25,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:25,546 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:25,546 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:10:25,546 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:25,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1279795021, now seen corresponding path program 1 times [2022-04-15 13:10:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:25,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481973814] [2022-04-15 13:10:27,843 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:10:27,845 INFO L85 PathProgramCache]: Analyzing trace with hash -748417914, now seen corresponding path program 1 times [2022-04-15 13:10:27,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:27,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453962718] [2022-04-15 13:10:27,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:27,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:28,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:10:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:28,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {349#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {340#true} is VALID [2022-04-15 13:10:28,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 13:10:28,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-15 13:10:28,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {340#true} call ULTIMATE.init(); {349#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:10:28,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {340#true} is VALID [2022-04-15 13:10:28,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {340#true} assume true; {340#true} is VALID [2022-04-15 13:10:28,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {340#true} {340#true} #76#return; {340#true} is VALID [2022-04-15 13:10:28,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {340#true} call #t~ret5 := main(); {340#true} is VALID [2022-04-15 13:10:28,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {340#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:28,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:28,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {345#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [80] L21-2-->L21-3_primed: Formula: (or (let ((.cse0 (mod (+ v_main_~l~0_Out_2 4294967295) 4294967296))) (and (< .cse0 (mod v_main_~n~0_In_1 4294967296)) (= (+ (* (- 1) v_main_~l~0_In_1) v_main_~v2~0_In_1) (+ (* (- 1) v_main_~l~0_Out_2) v_main_~v2~0_Out_2)) (= (mod (mod .cse0 6) 4294967296) 0) (= v_main_~n~0_In_1 0) (<= v_main_~l~0_In_1 v_main_~l~0_Out_2))) (and (= v_main_~l~0_In_1 v_main_~l~0_Out_2) (= v_main_~v2~0_In_1 v_main_~v2~0_Out_2) (= v_main_~n~0_In_1 v_main_~n~0_In_1))) InVars {main_~l~0=v_main_~l~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~v2~0=v_main_~v2~0_In_1} OutVars{main_~l~0=v_main_~l~0_Out_2, main_~n~0=v_main_~n~0_In_1, main_~v2~0=v_main_~v2~0_Out_2} AuxVars[] AssignedVars[main_~l~0, main_~v2~0] {346#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:28,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {346#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} [79] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {346#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} is VALID [2022-04-15 13:10:28,157 INFO L272 TraceCheckUtils]: 9: Hoare triple {346#(and (= main_~k~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (<= main_~l~0 main_~v2~0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {347#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:10:28,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {348#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:10:28,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {341#false} is VALID [2022-04-15 13:10:28,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {341#false} assume !false; {341#false} is VALID [2022-04-15 13:10:28,159 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:28,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:28,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453962718] [2022-04-15 13:10:28,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453962718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:28,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:28,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 13:10:28,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:10:28,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481973814] [2022-04-15 13:10:28,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481973814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:10:28,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:10:28,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:10:28,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838686261] [2022-04-15 13:10:28,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:10:28,337 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:10:28,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:10:28,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:28,351 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:10:28,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 13:10:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:28,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 13:10:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 13:10:28,352 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:30,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:34,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:37,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:41,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:46,032 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:48,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:50,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:54,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:10:59,012 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:01,178 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:03,597 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-15 13:11:03,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:11:03,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-15 13:11:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-15 13:11:03,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 52 transitions. [2022-04-15 13:11:03,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 52 transitions. [2022-04-15 13:11:05,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 51 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:05,793 INFO L225 Difference]: With dead ends: 39 [2022-04-15 13:11:05,793 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 13:11:05,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-04-15 13:11:05,797 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 26 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 10 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:05,798 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 48 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 93 Invalid, 10 Unknown, 0 Unchecked, 21.0s Time] [2022-04-15 13:11:05,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 13:11:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-15 13:11:05,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:05,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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:11:05,828 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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:11:05,828 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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:11:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:05,829 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 13:11:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 13:11:05,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:05,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:05,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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 24 states. [2022-04-15 13:11:05,830 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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 24 states. [2022-04-15 13:11:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:05,832 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 13:11:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 13:11:05,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:05,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:05,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:05,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 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:11:05,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2022-04-15 13:11:05,842 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 15 [2022-04-15 13:11:05,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:05,842 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2022-04-15 13:11:05,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:11:05,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 30 transitions. [2022-04-15 13:11:05,871 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:11:05,872 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2022-04-15 13:11:05,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 13:11:05,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:05,872 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:05,872 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:11:05,873 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:05,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:05,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1309439716, now seen corresponding path program 1 times [2022-04-15 13:11:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:05,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [10625443] [2022-04-15 13:11:06,125 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:06,128 INFO L85 PathProgramCache]: Analyzing trace with hash -689312570, now seen corresponding path program 1 times [2022-04-15 13:11:06,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:06,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107709591] [2022-04-15 13:11:06,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:06,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:06,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {553#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:06,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:06,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {541#true} #76#return; {546#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:06,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {541#true} call ULTIMATE.init(); {553#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:06,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {553#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:06,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:06,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {541#true} #76#return; {546#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:06,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {546#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {546#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:06,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {546#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {547#(and (or (not (<= (+ (div main_~n~0 4294967296) 1) 0)) (<= ~SIZE~0 (+ 2167483649 main_~n~0))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~n~0 2147483647) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:06,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {547#(and (or (not (<= (+ (div main_~n~0 4294967296) 1) 0)) (<= ~SIZE~0 (+ 2167483649 main_~n~0))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (<= main_~n~0 2147483647) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (div ~SIZE~0 4294967296) 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {548#(and (<= (div main_~n~0 4294967296) 0) (< 0 (+ main_~n~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:06,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(and (<= (div main_~n~0 4294967296) 0) (< 0 (+ main_~n~0 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [82] L21-2-->L21-3_primed: Formula: (or (let ((.cse0 (mod (+ v_main_~l~0_Out_4 4294967295) 4294967296))) (and (= (mod (mod .cse0 5) 4294967296) 0) (<= v_main_~l~0_In_2 v_main_~l~0_Out_4) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= v_main_~n~0_In_2 0) (< .cse0 (mod v_main_~n~0_In_2 4294967296)) (= (+ (* (- 1) v_main_~l~0_Out_4) v_main_~v3~0_Out_2) (+ v_main_~v3~0_In_1 (* (- 1) v_main_~l~0_In_2))))) (and (= v_main_~n~0_In_2 v_main_~n~0_In_2) (= v_main_~v3~0_In_1 v_main_~v3~0_Out_2) (= v_main_~l~0_In_2 v_main_~l~0_Out_4))) InVars {main_~l~0=v_main_~l~0_In_2, main_~v3~0=v_main_~v3~0_In_1, main_~n~0=v_main_~n~0_In_2} OutVars{main_~l~0=v_main_~l~0_Out_4, main_~v3~0=v_main_~v3~0_Out_2, main_~n~0=v_main_~n~0_In_2} AuxVars[] AssignedVars[main_~l~0, main_~v3~0] {549#(or (and (not (<= main_~n~0 0)) (<= (div main_~n~0 4294967296) (div main_~l~0 4294967296)) (<= (div (+ main_~l~0 4294967295) 4294967296) 0)) (and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (<= main_~v3~0 main_~l~0)) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0))))} is VALID [2022-04-15 13:11:06,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {549#(or (and (not (<= main_~n~0 0)) (<= (div main_~n~0 4294967296) (div main_~l~0 4294967296)) (<= (div (+ main_~l~0 4294967295) 4294967296) 0)) (and (or (and (<= (+ main_~l~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 main_~v3~0)) (<= main_~v3~0 main_~l~0)) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)))) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0))))} [81] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0))))} is VALID [2022-04-15 13:11:06,813 INFO L272 TraceCheckUtils]: 9: Hoare triple {550#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (not (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0))))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {551#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:11:06,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {551#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:11:06,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {542#false} is VALID [2022-04-15 13:11:06,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {542#false} assume !false; {542#false} is VALID [2022-04-15 13:11:06,814 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:06,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:06,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107709591] [2022-04-15 13:11:06,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107709591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:06,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:06,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:11:13,312 WARN L232 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 46 DAG size of output: 24 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-04-15 13:11:15,537 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:17,715 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (= (mod (mod .cse0 5) 4294967296) 0) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:19,925 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (= (+ (- 1) c_main_~l~0) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= (mod (mod .cse0 5) 4294967296) 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:22,100 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ 4294967295 c_main_~l~0) 4294967296))) (and (< 0 (+ c_main_~n~0 1)) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= (div c_main_~n~0 4294967296) 0) (= (+ (- 1) c_main_~l~0) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= (mod (mod .cse0 5) 4294967296) 0) (= (+ c_main_~v3~0 (- 1)) 0) (= c_main_~j~0 0) (= c_main_~k~0 0))) is different from true [2022-04-15 13:11:22,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:22,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [10625443] [2022-04-15 13:11:22,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [10625443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:22,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:22,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:11:22,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848078572] [2022-04-15 13:11:22,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:22,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:22,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:24,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:24,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:11:24,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:11:24,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=104, Unknown=4, NotChecked=66, Total=210 [2022-04-15 13:11:24,310 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:26,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:31,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:35,448 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:39,825 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:41,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:11:42,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:42,356 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:11:42,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 13:11:42,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:42,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:11:42,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 13:11:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 42 transitions. [2022-04-15 13:11:42,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 42 transitions. [2022-04-15 13:11:44,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 41 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:44,587 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:11:44,587 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:11:44,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=84, Invalid=230, Unknown=4, NotChecked=102, Total=420 [2022-04-15 13:11:44,588 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 12 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-04-15 13:11:44,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 60 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 109 Invalid, 5 Unknown, 80 Unchecked, 10.7s Time] [2022-04-15 13:11:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:11:44,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 13:11:44,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:11:44,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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:11:44,609 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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:11:44,609 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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:11:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:44,610 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 13:11:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 13:11:44,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:44,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:44,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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 29 states. [2022-04-15 13:11:44,611 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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 29 states. [2022-04-15 13:11:44,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:11:44,612 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-15 13:11:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-15 13:11:44,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:11:44,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:11:44,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:11:44,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:11:44,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 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:11:44,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2022-04-15 13:11:44,618 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 16 [2022-04-15 13:11:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:11:44,618 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2022-04-15 13:11:44,618 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.0) internal successors, (12), 10 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:11:44,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 34 transitions. [2022-04-15 13:11:46,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-04-15 13:11:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:11:46,965 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:11:46,965 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:11:46,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 13:11:46,966 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:11:46,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:11:46,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1923990926, now seen corresponding path program 1 times [2022-04-15 13:11:46,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:46,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1897983924] [2022-04-15 13:11:47,202 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:11:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash -630207226, now seen corresponding path program 1 times [2022-04-15 13:11:47,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:11:47,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344096144] [2022-04-15 13:11:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:11:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:11:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:11:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:11:48,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {765#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:48,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:48,041 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {753#true} #76#return; {758#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:48,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {753#true} call ULTIMATE.init(); {765#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:11:48,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {765#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:48,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} assume true; {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} is VALID [2022-04-15 13:11:48,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {766#(and (<= 20000001 ~SIZE~0) (<= ~SIZE~0 20000001))} {753#true} #76#return; {758#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:48,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {758#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} call #t~ret5 := main(); {758#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} is VALID [2022-04-15 13:11:48,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {758#(and (<= ~SIZE~0 20000001) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)))} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {759#(and (<= ~SIZE~0 20000001) (<= (div main_~n~0 4294967296) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (<= ~SIZE~0 (+ 2167483649 main_~n~0)) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:48,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {759#(and (<= ~SIZE~0 20000001) (<= (div main_~n~0 4294967296) 0) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (not (<= (+ (div ~SIZE~0 4294967296) 1) 0)) (<= ~SIZE~0 (+ 2167483649 main_~n~0)) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {760#(and (<= (div main_~n~0 4294967296) 0) (< 0 (+ (div main_~n~0 4294967296) 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:48,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#(and (<= (div main_~n~0 4294967296) 0) (< 0 (+ (div main_~n~0 4294967296) 1)) (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (<= main_~n~0 (+ 20000001 (* (div main_~n~0 4294967296) 4294967296))) (= main_~v3~0 0))} [84] L21-2-->L21-3_primed: Formula: (or (let ((.cse0 (mod (+ v_main_~l~0_Out_6 4294967295) 4294967296))) (and (= (mod (+ v_main_~l~0_Out_6 3) 4) 0) (= v_main_~n~0_In_3 0) (<= v_main_~l~0_In_3 v_main_~l~0_Out_6) (not (= (mod (mod .cse0 5) 4294967296) 0)) (not (= (mod (mod .cse0 6) 4294967296) 0)) (< .cse0 (mod v_main_~n~0_In_3 4294967296)) (= (+ (* (- 1) v_main_~l~0_Out_6) v_main_~v4~0_Out_2) (+ (* (- 1) v_main_~l~0_In_3) v_main_~v4~0_In_1)))) (and (= v_main_~n~0_In_3 v_main_~n~0_In_3) (= v_main_~l~0_In_3 v_main_~l~0_Out_6) (= v_main_~v4~0_In_1 v_main_~v4~0_Out_2))) InVars {main_~l~0=v_main_~l~0_In_3, main_~n~0=v_main_~n~0_In_3, main_~v4~0=v_main_~v4~0_In_1} OutVars{main_~l~0=v_main_~l~0_Out_6, main_~n~0=v_main_~n~0_In_3, main_~v4~0=v_main_~v4~0_Out_2} AuxVars[] AssignedVars[main_~l~0, main_~v4~0] {761#(and (= main_~k~0 0) (= main_~v2~0 0) (<= (+ (div (+ main_~l~0 4294967295) 4294967296) (div main_~n~0 4294967296)) (div main_~l~0 4294967296)) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) main_~n~0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1))) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:48,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {761#(and (= main_~k~0 0) (= main_~v2~0 0) (<= (+ (div (+ main_~l~0 4294967295) 4294967296) (div main_~n~0 4294967296)) (div main_~l~0 4294967296)) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (or (<= (+ (* (div main_~n~0 4294967296) 4294967296) main_~v4~0) main_~n~0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1))) (= main_~v3~0 0))} [83] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {762#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (= main_~v3~0 0))} is VALID [2022-04-15 13:11:48,053 INFO L272 TraceCheckUtils]: 9: Hoare triple {762#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (not (<= (+ (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 1) 0)) (= main_~i~0 0) (< (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0) (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296) 1)) (<= (+ main_~l~0 (* (div (+ main_~i~0 main_~k~0 main_~j~0 main_~v3~0 main_~v2~0 main_~v4~0) 4294967296) 4294967296)) (+ main_~i~0 main_~k~0 main_~j~0 (* (div main_~l~0 4294967296) 4294967296) main_~v3~0 main_~v2~0 main_~v4~0)) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {763#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:11:48,053 INFO L290 TraceCheckUtils]: 10: Hoare triple {763#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {764#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:11:48,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {764#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {754#false} is VALID [2022-04-15 13:11:48,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-04-15 13:11:48,054 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:48,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:11:48,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344096144] [2022-04-15 13:11:48,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344096144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:48,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:48,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 13:11:50,405 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_main_~n~0 4294967296)) (.cse1 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (< 0 (+ .cse0 1)) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse0 4294967296) 20000001)) (<= .cse0 0) (< .cse1 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse1 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:52,647 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~n~0 4294967296)) (.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (< 0 (+ .cse1 1)) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse1 4294967296) 20000001)) (<= .cse1 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:54,901 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (div c_main_~n~0 4294967296)) (.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (< 0 (+ .cse1 1)) (= c_main_~v2~0 0) (<= c_main_~n~0 (+ (* .cse1 4294967296) 20000001)) (<= .cse1 0) (= (mod c_main_~l~0 4) 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~v4~0 1) (= c_main_~k~0 0))) is different from false [2022-04-15 13:11:54,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:11:54,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1897983924] [2022-04-15 13:11:54,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1897983924] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:11:54,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:11:54,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 13:11:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375379033] [2022-04-15 13:11:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:11:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:11:54,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:11:54,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:11:57,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:11:57,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 13:11:57,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:11:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 13:11:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=105, Unknown=3, NotChecked=66, Total=210 [2022-04-15 13:11:57,162 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:11:59,544 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:01,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:03,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:10,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:15,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:17,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:17,723 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2022-04-15 13:12:17,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:12:17,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:12:17,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:12:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:12:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 13:12:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:12:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 53 transitions. [2022-04-15 13:12:17,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 53 transitions. [2022-04-15 13:12:20,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:20,021 INFO L225 Difference]: With dead ends: 42 [2022-04-15 13:12:20,021 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 13:12:20,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=74, Invalid=175, Unknown=3, NotChecked=90, Total=342 [2022-04-15 13:12:20,021 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:12:20,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 55 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 5 Unknown, 65 Unchecked, 10.3s Time] [2022-04-15 13:12:20,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 13:12:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 13:12:20,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:12:20,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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:12:20,054 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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:12:20,054 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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:12:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:20,055 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 13:12:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 13:12:20,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:20,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:20,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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 29 states. [2022-04-15 13:12:20,056 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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 29 states. [2022-04-15 13:12:20,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:12:20,058 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-15 13:12:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-15 13:12:20,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:12:20,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:12:20,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:12:20,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:12:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 23 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:12:20,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-15 13:12:20,060 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-04-15 13:12:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:12:20,060 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-15 13:12:20,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 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:12:20,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-15 13:12:22,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:22,374 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-15 13:12:22,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 13:12:22,374 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:12:22,374 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:12:22,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 13:12:22,375 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:12:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:12:22,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1061425385, now seen corresponding path program 1 times [2022-04-15 13:12:22,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:22,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [248980468] [2022-04-15 13:12:22,561 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:12:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash -571101882, now seen corresponding path program 1 times [2022-04-15 13:12:22,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:12:22,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495500904] [2022-04-15 13:12:22,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:12:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:12:22,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:12:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:12:22,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {987#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {979#true} is VALID [2022-04-15 13:12:22,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-15 13:12:22,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #76#return; {979#true} is VALID [2022-04-15 13:12:22,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {987#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:12:22,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {979#true} is VALID [2022-04-15 13:12:22,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {979#true} assume true; {979#true} is VALID [2022-04-15 13:12:22,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {979#true} {979#true} #76#return; {979#true} is VALID [2022-04-15 13:12:22,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {979#true} call #t~ret5 := main(); {979#true} is VALID [2022-04-15 13:12:22,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {979#true} ~n~0 := 0;~i~0 := 0;~k~0 := 0;~j~0 := 0;~l~0 := 0;~v2~0 := 0;~v3~0 := 0;~v4~0 := 0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4; {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:12:22,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296); {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:12:24,978 WARN L290 TraceCheckUtils]: 7: Hoare triple {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [86] L21-2-->L21-3_primed: Formula: (or (and (= v_main_~n~0_In_4 v_main_~n~0_In_4) (= v_main_~i~0_In_1 v_main_~i~0_Out_2) (= v_main_~l~0_In_4 v_main_~l~0_Out_8)) (let ((.cse0 (mod (+ v_main_~l~0_Out_8 4294967295) 4294967296))) (and (= (+ (* (- 1) v_main_~l~0_In_4) v_main_~i~0_In_1) (+ (* (- 1) v_main_~l~0_Out_8) v_main_~i~0_Out_2)) (<= v_main_~l~0_In_4 v_main_~l~0_Out_8) (< .cse0 (mod v_main_~n~0_In_4 4294967296)) (not (= (mod (+ v_main_~l~0_Out_8 3) 4) 0)) (= v_main_~n~0_In_4 0) (not (= 0 (mod (mod .cse0 5) 4294967296))) (= (mod (mod .cse0 3) 4294967296) 0) (not (= (mod (mod .cse0 6) 4294967296) 0))))) InVars {main_~i~0=v_main_~i~0_In_1, main_~l~0=v_main_~l~0_In_4, main_~n~0=v_main_~n~0_In_4} OutVars{main_~i~0=v_main_~i~0_Out_2, main_~l~0=v_main_~l~0_Out_8, main_~n~0=v_main_~n~0_In_4} AuxVars[] AssignedVars[main_~l~0, main_~i~0] {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is UNKNOWN [2022-04-15 13:12:24,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} [85] L21-3_primed-->L21-3: Formula: (not (< (mod v_main_~l~0_11 4294967296) (mod v_main_~n~0_5 4294967296))) InVars {main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} OutVars{main_~l~0=v_main_~l~0_11, main_~n~0=v_main_~n~0_5} AuxVars[] AssignedVars[] {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} is VALID [2022-04-15 13:12:24,980 INFO L272 TraceCheckUtils]: 9: Hoare triple {984#(and (= main_~k~0 0) (= main_~v2~0 0) (= main_~j~0 0) (= main_~l~0 0) (= main_~i~0 0) (= main_~v4~0 0) (= main_~v3~0 0))} call __VERIFIER_assert((if (~i~0 + ~j~0 + ~k~0 + ~v4~0 + ~v3~0 + ~v2~0) % 4294967296 == ~l~0 % 4294967296 then 1 else 0)); {985#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 13:12:24,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {985#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {986#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 13:12:24,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {986#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {980#false} is VALID [2022-04-15 13:12:24,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {980#false} assume !false; {980#false} is VALID [2022-04-15 13:12:24,981 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:24,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:12:24,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495500904] [2022-04-15 13:12:24,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495500904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:24,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:24,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:12:44,691 WARN L232 SmtUtils]: Spent 19.69s on a formula simplification. DAG size of input: 51 DAG size of output: 17 (called from [L 182] de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.MetaTraceTransformer.getInductiveLoopInterpolants) [2022-04-15 13:12:46,951 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:12:49,198 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~l~0 4294967296))) (and (not (= (mod (mod .cse0 5) 4294967296) 0)) (= c_main_~i~0 0) (= c_main_~v4~0 0) (= c_main_~v2~0 0) (< .cse0 (mod c_main_~n~0 4294967296)) (= c_main_~l~0 0) (= c_main_~v3~0 0) (= c_main_~j~0 0) (not (= (mod (mod .cse0 6) 4294967296) 0)) (= c_main_~k~0 0))) is different from false [2022-04-15 13:12:49,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [248980468] [2022-04-15 13:12:49,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [248980468] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:49,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:49,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 13:12:49,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245471656] [2022-04-15 13:12:49,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:49,212 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:12:49,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:49,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:51,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:51,461 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 13:12:51,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:51,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 13:12:51,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=32, Unknown=2, NotChecked=22, Total=72 [2022-04-15 13:12:51,462 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:53,580 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:12:58,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:13:00,332 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:13:02,518 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 13:13:02,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:02,814 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 13:13:02,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:13:02,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 13:13:02,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 13:13:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-15 13:13:02,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-15 13:13:05,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 47 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:05,083 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:13:05,083 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 13:13:05,083 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2022-04-15 13:13:05,084 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:05,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 52 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 4 Unknown, 40 Unchecked, 8.5s Time] [2022-04-15 13:13:05,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 13:13:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-15 13:13:05,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:05,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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:13:05,116 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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:13:05,117 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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:13:05,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:05,117 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 13:13:05,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 13:13:05,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:05,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:05,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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 28 states. [2022-04-15 13:13:05,118 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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 28 states. [2022-04-15 13:13:05,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:05,118 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-15 13:13:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 13:13:05,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:05,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:05,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:05,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 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:13:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-15 13:13:05,120 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 18 [2022-04-15 13:13:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:05,120 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-15 13:13:05,120 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:05,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-15 13:13:07,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-15 13:13:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:13:07,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:07,410 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:07,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 13:13:07,410 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 57783349, now seen corresponding path program 1 times [2022-04-15 13:13:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1797118439] [2022-04-15 13:13:10,786 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-15 13:13:10,799 INFO L158 Benchmark]: Toolchain (without parser) took 199554.62ms. Allocated memory was 179.3MB in the beginning and 223.3MB in the end (delta: 44.0MB). Free memory was 127.7MB in the beginning and 181.6MB in the end (delta: -53.8MB). Peak memory consumption was 98.4MB. Max. memory is 8.0GB. [2022-04-15 13:13:10,799 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 13:13:10,799 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 179.3MB. Free memory was 127.5MB in the beginning and 154.5MB in the end (delta: -27.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-15 13:13:10,799 INFO L158 Benchmark]: Boogie Preprocessor took 40.63ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 13:13:10,799 INFO L158 Benchmark]: RCFGBuilder took 6790.92ms. Allocated memory is still 179.3MB. Free memory was 152.4MB in the beginning and 140.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 13:13:10,799 INFO L158 Benchmark]: TraceAbstraction took 192474.14ms. Allocated memory was 179.3MB in the beginning and 223.3MB in the end (delta: 44.0MB). Free memory was 139.8MB in the beginning and 181.6MB in the end (delta: -41.7MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. [2022-04-15 13:13:10,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 179.3MB. Free memory is still 144.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.60ms. Allocated memory is still 179.3MB. Free memory was 127.5MB in the beginning and 154.5MB in the end (delta: -27.0MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.63ms. Allocated memory is still 179.3MB. Free memory was 154.5MB in the beginning and 152.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 6790.92ms. Allocated memory is still 179.3MB. Free memory was 152.4MB in the beginning and 140.3MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 192474.14ms. Allocated memory was 179.3MB in the beginning and 223.3MB in the end (delta: 44.0MB). Free memory was 139.8MB in the beginning and 181.6MB in the end (delta: -41.7MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 13:13:10,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...