/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:52:33,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:52:33,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:52:33,145 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:52:33,145 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:52:33,146 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:52:33,147 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:52:33,149 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:52:33,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:52:33,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:52:33,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:52:33,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:52:33,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:52:33,153 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:52:33,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:52:33,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:52:33,156 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:52:33,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:52:33,158 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:52:33,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:52:33,160 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:52:33,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:52:33,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:52:33,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:52:33,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:52:33,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:52:33,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:52:33,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:52:33,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:52:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:52:33,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:52:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:52:33,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:52:33,170 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:52:33,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:52:33,171 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:52:33,171 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:52:33,172 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:52:33,172 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:52:33,172 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:52:33,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:52:33,174 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:52:33,175 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 15:52:33,182 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:52:33,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:52:33,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:52:33,183 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:52:33,183 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:52:33,184 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:52:33,184 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:52:33,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:52:33,184 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:52:33,184 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:52:33,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:52:33,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:52:33,185 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:52:33,185 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:52:33,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:52:33,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:52:33,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:52:33,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:52:33,186 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:52:33,186 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:52:33,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:52:33,187 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:52:33,187 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 15:52:33,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:52:33,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:52:33,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:52:33,416 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:52:33,419 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:52:33,420 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound5.c [2022-04-15 15:52:33,488 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977b8136c/faf8599ceb654bd19161b226817c73b0/FLAG4e678bdb2 [2022-04-15 15:52:33,892 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:52:33,893 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound5.c [2022-04-15 15:52:33,900 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977b8136c/faf8599ceb654bd19161b226817c73b0/FLAG4e678bdb2 [2022-04-15 15:52:34,298 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/977b8136c/faf8599ceb654bd19161b226817c73b0 [2022-04-15 15:52:34,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:52:34,302 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:52:34,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:52:34,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:52:34,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:52:34,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@152b686a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34, skipping insertion in model container [2022-04-15 15:52:34,312 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:52:34,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:52:34,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound5.c[552,565] [2022-04-15 15:52:34,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:52:34,495 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:52:34,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound5.c[552,565] [2022-04-15 15:52:34,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:52:34,526 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:52:34,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34 WrapperNode [2022-04-15 15:52:34,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:52:34,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:52:34,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:52:34,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:52:34,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,570 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,572 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:52:34,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:52:34,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:52:34,573 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:52:34,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (1/1) ... [2022-04-15 15:52:34,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:52:34,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:52:34,604 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 15:52:34,613 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 15:52:34,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:52:34,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:52:34,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:52:34,646 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:52:34,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:52:34,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:52:34,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:52:34,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:52:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:52:34,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:52:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:52:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:52:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:52:34,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:52:34,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:52:34,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:52:34,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:52:34,854 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:52:34,860 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:52:34,860 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:52:34,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:52:34 BoogieIcfgContainer [2022-04-15 15:52:34,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:52:34,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:52:34,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:52:34,882 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:52:34,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:52:34" (1/3) ... [2022-04-15 15:52:34,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beaeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:52:34, skipping insertion in model container [2022-04-15 15:52:34,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:52:34" (2/3) ... [2022-04-15 15:52:34,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2beaeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:52:34, skipping insertion in model container [2022-04-15 15:52:34,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:52:34" (3/3) ... [2022-04-15 15:52:34,885 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound5.c [2022-04-15 15:52:34,889 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:52:34,889 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:52:34,925 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:52:34,930 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 15:52:34,930 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:52:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:52:34,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 15:52:34,951 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:52:34,952 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:52:34,952 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:52:34,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:52:34,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1515787587, now seen corresponding path program 1 times [2022-04-15 15:52:34,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:34,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [30397021] [2022-04-15 15:52:34,972 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:52:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1515787587, now seen corresponding path program 2 times [2022-04-15 15:52:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:52:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149583338] [2022-04-15 15:52:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:52:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:52:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:52:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(and (= ~counter~0 |old(~counter~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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-15 15:52:35,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-15 15:52:35,154 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #111#return; {43#true} is VALID [2022-04-15 15:52:35,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:52:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-15 15:52:35,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 15:52:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-15 15:52:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 15:52:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-15 15:52:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 15:52:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:35,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-15 15:52:35,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {64#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:52:35,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(and (= ~counter~0 |old(~counter~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(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-15 15:52:35,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-15 15:52:35,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #111#return; {43#true} is VALID [2022-04-15 15:52:35,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-15 15:52:35,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-15 15:52:35,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-15 15:52:35,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #93#return; {44#false} is VALID [2022-04-15 15:52:35,211 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-15 15:52:35,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #95#return; {44#false} is VALID [2022-04-15 15:52:35,212 INFO L272 TraceCheckUtils]: 16: Hoare triple {44#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-15 15:52:35,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,213 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,213 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44#false} {44#false} #97#return; {44#false} is VALID [2022-04-15 15:52:35,214 INFO L272 TraceCheckUtils]: 21: Hoare triple {44#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {43#true} is VALID [2022-04-15 15:52:35,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-15 15:52:35,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-15 15:52:35,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-15 15:52:35,215 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {44#false} {44#false} #99#return; {44#false} is VALID [2022-04-15 15:52:35,215 INFO L290 TraceCheckUtils]: 26: Hoare triple {44#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {44#false} is VALID [2022-04-15 15:52:35,216 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-15 15:52:35,216 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {44#false} is VALID [2022-04-15 15:52:35,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-15 15:52:35,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-15 15:52:35,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-15 15:52:35,217 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 15:52:35,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:52:35,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149583338] [2022-04-15 15:52:35,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149583338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:35,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:35,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:52:35,222 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:52:35,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [30397021] [2022-04-15 15:52:35,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [30397021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:35,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:35,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:52:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346750176] [2022-04-15 15:52:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:52:35,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 15:52:35,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:52:35,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:35,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:35,277 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 15:52:35,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:35,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 15:52:35,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:52:35,311 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:35,572 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2022-04-15 15:52:35,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 15:52:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 15:52:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:52:35,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-15 15:52:35,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:35,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-15 15:52:35,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-04-15 15:52:35,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:35,737 INFO L225 Difference]: With dead ends: 74 [2022-04-15 15:52:35,737 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 15:52:35,740 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 15:52:35,770 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:52:35,771 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:52:35,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 15:52:35,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 15:52:35,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:52:35,815 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:35,817 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:35,818 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:35,826 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 15:52:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 15:52:35,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:35,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:35,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-15 15:52:35,828 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-15 15:52:35,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:35,838 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 15:52:35,839 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 15:52:35,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:35,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:35,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:52:35,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:52:35,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:35,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 15:52:35,844 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 32 [2022-04-15 15:52:35,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:52:35,844 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-04-15 15:52:35,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:35,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-15 15:52:35,904 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 15:52:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 15:52:35,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 15:52:35,906 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:52:35,907 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:52:35,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 15:52:35,907 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:52:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:52:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash 182383832, now seen corresponding path program 1 times [2022-04-15 15:52:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:35,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037961393] [2022-04-15 15:52:35,912 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:52:35,912 INFO L85 PathProgramCache]: Analyzing trace with hash 182383832, now seen corresponding path program 2 times [2022-04-15 15:52:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:52:35,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194673885] [2022-04-15 15:52:35,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:52:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:52:35,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:52:35,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [97273431] [2022-04-15 15:52:35,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:52:35,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:52:35,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:52:35,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:52:35,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:52:36,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:52:36,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:52:36,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:52:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:36,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:52:36,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2022-04-15 15:52:36,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {365#(<= ~counter~0 0)} assume true; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {365#(<= ~counter~0 0)} {357#true} #111#return; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {365#(<= ~counter~0 0)} call #t~ret9 := main(); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {365#(<= ~counter~0 0)} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {365#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {365#(<= ~counter~0 0)} ~cond := #in~cond; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {365#(<= ~counter~0 0)} assume !(0 == ~cond); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {365#(<= ~counter~0 0)} assume true; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {365#(<= ~counter~0 0)} {365#(<= ~counter~0 0)} #93#return; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,344 INFO L272 TraceCheckUtils]: 11: Hoare triple {365#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#(<= ~counter~0 0)} ~cond := #in~cond; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#(<= ~counter~0 0)} assume !(0 == ~cond); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#(<= ~counter~0 0)} assume true; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,346 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {365#(<= ~counter~0 0)} {365#(<= ~counter~0 0)} #95#return; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,347 INFO L272 TraceCheckUtils]: 16: Hoare triple {365#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {365#(<= ~counter~0 0)} ~cond := #in~cond; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {365#(<= ~counter~0 0)} assume !(0 == ~cond); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {365#(<= ~counter~0 0)} assume true; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,349 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {365#(<= ~counter~0 0)} {365#(<= ~counter~0 0)} #97#return; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,350 INFO L272 TraceCheckUtils]: 21: Hoare triple {365#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,350 INFO L290 TraceCheckUtils]: 22: Hoare triple {365#(<= ~counter~0 0)} ~cond := #in~cond; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,351 INFO L290 TraceCheckUtils]: 23: Hoare triple {365#(<= ~counter~0 0)} assume !(0 == ~cond); {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {365#(<= ~counter~0 0)} assume true; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,352 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {365#(<= ~counter~0 0)} {365#(<= ~counter~0 0)} #99#return; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {365#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {365#(<= ~counter~0 0)} is VALID [2022-04-15 15:52:36,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {365#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {444#(<= |main_#t~post6| 0)} is VALID [2022-04-15 15:52:36,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {444#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {358#false} is VALID [2022-04-15 15:52:36,354 INFO L272 TraceCheckUtils]: 29: Hoare triple {358#false} call __VERIFIER_assert((if (~u~0 * ~y~0 + ~v~0 * ~y~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {358#false} is VALID [2022-04-15 15:52:36,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {358#false} ~cond := #in~cond; {358#false} is VALID [2022-04-15 15:52:36,355 INFO L290 TraceCheckUtils]: 31: Hoare triple {358#false} assume 0 == ~cond; {358#false} is VALID [2022-04-15 15:52:36,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {358#false} assume !false; {358#false} is VALID [2022-04-15 15:52:36,355 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 15:52:36,356 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:52:36,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:52:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194673885] [2022-04-15 15:52:36,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:52:36,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97273431] [2022-04-15 15:52:36,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [97273431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:36,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:36,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:52:36,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:52:36,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037961393] [2022-04-15 15:52:36,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037961393] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:36,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:36,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:52:36,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052706992] [2022-04-15 15:52:36,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:52:36,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 15:52:36,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:52:36,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:36,393 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 15:52:36,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:52:36,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:36,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:52:36,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:52:36,394 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:36,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:36,538 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 15:52:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:52:36,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 15:52:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:52:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:36,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 15:52:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 15:52:36,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-15 15:52:36,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:36,606 INFO L225 Difference]: With dead ends: 45 [2022-04-15 15:52:36,606 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 15:52:36,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:52:36,608 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:52:36,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:52:36,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 15:52:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 15:52:36,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:52:36,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:36,626 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:36,626 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:36,629 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-15 15:52:36,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 15:52:36,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:36,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:36,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-15 15:52:36,630 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-15 15:52:36,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:36,632 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-15 15:52:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 15:52:36,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:36,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:36,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:52:36,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:52:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:52:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-15 15:52:36,636 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 33 [2022-04-15 15:52:36,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:52:36,636 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-15 15:52:36,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:52:36,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 49 transitions. [2022-04-15 15:52:36,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 15:52:36,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 15:52:36,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:52:36,689 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:52:36,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 15:52:36,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:52:36,923 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:52:36,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:52:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 184052128, now seen corresponding path program 1 times [2022-04-15 15:52:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:36,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50320685] [2022-04-15 15:52:36,924 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:52:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash 184052128, now seen corresponding path program 2 times [2022-04-15 15:52:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:52:36,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588496356] [2022-04-15 15:52:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:52:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:52:36,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:52:36,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [927035161] [2022-04-15 15:52:36,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:52:36,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:52:36,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:52:36,949 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:52:36,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:52:37,013 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:52:37,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:52:37,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:52:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:52:37,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:52:37,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {697#true} call ULTIMATE.init(); {697#true} is VALID [2022-04-15 15:52:37,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {697#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(7, 2);call write~init~int(108, 2, 0, 1);call write~init~int(99, 2, 1, 1);call write~init~int(109, 2, 2, 1);call write~init~int(49, 2, 3, 1);call write~init~int(46, 2, 4, 1);call write~init~int(99, 2, 5, 1);call write~init~int(0, 2, 6, 1);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {697#true} is VALID [2022-04-15 15:52:37,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {697#true} assume true; {697#true} is VALID [2022-04-15 15:52:37,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {697#true} {697#true} #111#return; {697#true} is VALID [2022-04-15 15:52:37,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {697#true} call #t~ret9 := main(); {697#true} is VALID [2022-04-15 15:52:37,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {697#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~u~0;havoc ~v~0;~a~0 := #t~nondet4;havoc #t~nondet4;~b~0 := #t~nondet5;havoc #t~nondet5; {697#true} is VALID [2022-04-15 15:52:37,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {697#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {697#true} is VALID [2022-04-15 15:52:37,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {697#true} ~cond := #in~cond; {697#true} is VALID [2022-04-15 15:52:37,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {697#true} assume !(0 == ~cond); {697#true} is VALID [2022-04-15 15:52:37,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {697#true} assume true; {697#true} is VALID [2022-04-15 15:52:37,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {697#true} {697#true} #93#return; {697#true} is VALID [2022-04-15 15:52:37,222 INFO L272 TraceCheckUtils]: 11: Hoare triple {697#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {697#true} is VALID [2022-04-15 15:52:37,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#true} ~cond := #in~cond; {697#true} is VALID [2022-04-15 15:52:37,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#true} assume !(0 == ~cond); {697#true} is VALID [2022-04-15 15:52:37,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {697#true} assume true; {697#true} is VALID [2022-04-15 15:52:37,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {697#true} {697#true} #95#return; {697#true} is VALID [2022-04-15 15:52:37,227 INFO L272 TraceCheckUtils]: 16: Hoare triple {697#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {697#true} is VALID [2022-04-15 15:52:37,227 INFO L290 TraceCheckUtils]: 17: Hoare triple {697#true} ~cond := #in~cond; {697#true} is VALID [2022-04-15 15:52:37,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#true} assume !(0 == ~cond); {697#true} is VALID [2022-04-15 15:52:37,228 INFO L290 TraceCheckUtils]: 19: Hoare triple {697#true} assume true; {697#true} is VALID [2022-04-15 15:52:37,228 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {697#true} {697#true} #97#return; {697#true} is VALID [2022-04-15 15:52:37,228 INFO L272 TraceCheckUtils]: 21: Hoare triple {697#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {697#true} is VALID [2022-04-15 15:52:37,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#true} ~cond := #in~cond; {697#true} is VALID [2022-04-15 15:52:37,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#true} assume !(0 == ~cond); {697#true} is VALID [2022-04-15 15:52:37,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {697#true} assume true; {697#true} is VALID [2022-04-15 15:52:37,229 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {697#true} {697#true} #99#return; {697#true} is VALID [2022-04-15 15:52:37,230 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := 0; {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:52:37,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:52:37,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 5);havoc #t~post6; {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 15:52:37,232 INFO L272 TraceCheckUtils]: 29: Hoare triple {780#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {790#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:52:37,234 INFO L290 TraceCheckUtils]: 30: Hoare triple {790#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {794#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:52:37,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {794#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {698#false} is VALID [2022-04-15 15:52:37,235 INFO L290 TraceCheckUtils]: 32: Hoare triple {698#false} assume !false; {698#false} is VALID [2022-04-15 15:52:37,236 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 15:52:37,236 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:52:37,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:52:37,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588496356] [2022-04-15 15:52:37,236 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:52:37,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927035161] [2022-04-15 15:52:37,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927035161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:37,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:37,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:52:37,237 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:52:37,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50320685] [2022-04-15 15:52:37,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50320685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:52:37,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:52:37,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:52:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132864718] [2022-04-15 15:52:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:52:37,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 15:52:37,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:52:37,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:52:37,271 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 15:52:37,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:52:37,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:37,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:52:37,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:52:37,276 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:52:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:37,573 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-15 15:52:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:52:37,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 15:52:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:52:37,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:52:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-15 15:52:37,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:52:37,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-15 15:52:37,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2022-04-15 15:52:37,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:37,670 INFO L225 Difference]: With dead ends: 57 [2022-04-15 15:52:37,670 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 15:52:37,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:52:37,672 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:52:37,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:52:37,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 15:52:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-15 15:52:37,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:52:37,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:52:37,693 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:52:37,694 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:52:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:37,697 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-15 15:52:37,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-15 15:52:37,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:37,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:37,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-15 15:52:37,699 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-15 15:52:37,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:52:37,702 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-15 15:52:37,702 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-15 15:52:37,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:52:37,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:52:37,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:52:37,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:52:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 15:52:37,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2022-04-15 15:52:37,705 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 33 [2022-04-15 15:52:37,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:52:37,706 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2022-04-15 15:52:37,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 15:52:37,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 73 transitions. [2022-04-15 15:52:37,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:52:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 15:52:37,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 15:52:37,787 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:52:37,787 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:52:37,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 15:52:38,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 15:52:38,002 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:52:38,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:52:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 758334593, now seen corresponding path program 1 times [2022-04-15 15:52:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:52:38,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190334010] [2022-04-15 15:52:38,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:52:38,004 INFO L85 PathProgramCache]: Analyzing trace with hash 758334593, now seen corresponding path program 2 times [2022-04-15 15:52:38,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:52:38,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474020501] [2022-04-15 15:52:38,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:52:38,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:52:38,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:52:38,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294547350] [2022-04-15 15:52:38,028 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:52:38,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:52:38,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:52:38,030 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:52:38,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process