/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/lcm2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:30:55,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:30:55,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:30:55,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:30:55,556 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:30:55,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:30:55,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:30:55,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:30:55,564 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:30:55,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:30:55,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:30:55,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:30:55,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:30:55,573 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:30:55,574 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:30:55,577 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:30:55,578 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:30:55,578 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:30:55,580 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:30:55,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:30:55,587 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:30:55,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:30:55,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:30:55,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:30:55,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:30:55,597 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:30:55,597 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:30:55,597 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:30:55,598 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:30:55,599 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:30:55,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:30:55,600 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:30:55,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:30:55,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:30:55,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:30:55,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:30:55,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:30:55,604 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:30:55,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:30:55,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:30:55,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:30:55,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:30:55,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:30:55,619 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:30:55,619 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:30:55,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:30:55,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:30:55,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:30:55,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:30:55,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:30:55,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:30:55,621 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:30:55,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:30:55,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:30:55,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:30:55,623 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:30:55,623 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:30:55,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:30:55,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:30:55,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:30:55,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:30:55,624 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:30:55,624 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:30:55,624 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:30:55,624 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:30:55,624 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:30:55,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:30:55,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:30:55,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:30:55,850 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:30:55,851 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:30:55,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/lcm2.c [2022-04-15 13:30:55,919 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8be75bc/3351b4f25f93477abe59f5a57372d56c/FLAG89c96b76f [2022-04-15 13:30:56,271 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:30:56,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/lcm2.c [2022-04-15 13:30:56,279 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8be75bc/3351b4f25f93477abe59f5a57372d56c/FLAG89c96b76f [2022-04-15 13:30:56,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e8be75bc/3351b4f25f93477abe59f5a57372d56c [2022-04-15 13:30:56,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:30:56,701 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:30:56,703 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:30:56,703 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:30:56,706 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:30:56,707 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f54f8b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56, skipping insertion in model container [2022-04-15 13:30:56,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:30:56,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:30:56,862 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/lcm2.c[537,550] [2022-04-15 13:30:56,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:30:56,884 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:30:56,895 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/lcm2.c[537,550] [2022-04-15 13:30:56,902 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:30:56,914 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:30:56,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56 WrapperNode [2022-04-15 13:30:56,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:30:56,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:30:56,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:30:56,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:30:56,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:30:56,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:30:56,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:30:56,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:30:56,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (1/1) ... [2022-04-15 13:30:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:30:56,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:56,987 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:30:57,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:30:57,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:30:57,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:30:57,041 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:30:57,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:30:57,042 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:30:57,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:30:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:30:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:30:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:30:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:30:57,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 13:30:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:30:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:30:57,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:30:57,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:30:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:30:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:30:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:30:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:30:57,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:30:57,108 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:30:57,110 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:30:57,257 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:30:57,263 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:30:57,263 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:30:57,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:57 BoogieIcfgContainer [2022-04-15 13:30:57,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:30:57,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:30:57,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:30:57,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:30:57,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:30:56" (1/3) ... [2022-04-15 13:30:57,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8506f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:57, skipping insertion in model container [2022-04-15 13:30:57,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:30:56" (2/3) ... [2022-04-15 13:30:57,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8506f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:30:57, skipping insertion in model container [2022-04-15 13:30:57,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:30:57" (3/3) ... [2022-04-15 13:30:57,272 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2.c [2022-04-15 13:30:57,276 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:30:57,276 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:30:57,318 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:30:57,323 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:30:57,324 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:30:57,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 13:30:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:30:57,372 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:57,373 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 13:30:57,374 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:57,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:57,384 INFO L85 PathProgramCache]: Analyzing trace with hash 656971502, now seen corresponding path program 1 times [2022-04-15 13:30:57,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:57,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1399264091] [2022-04-15 13:30:57,409 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 656971502, now seen corresponding path program 2 times [2022-04-15 13:30:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:57,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127966555] [2022-04-15 13:30:57,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:57,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:30:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(50, 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); {34#true} is VALID [2022-04-15 13:30:57,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:30:57,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #72#return; {34#true} is VALID [2022-04-15 13:30:57,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:30:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,649 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {34#true} #60#return; {35#false} is VALID [2022-04-15 13:30:57,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 13:30:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,659 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #62#return; {35#false} is VALID [2022-04-15 13:30:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 13:30:57,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #64#return; {35#false} is VALID [2022-04-15 13:30:57,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 13:30:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:57,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2022-04-15 13:30:57,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:30:57,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(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(50, 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); {34#true} is VALID [2022-04-15 13:30:57,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-15 13:30:57,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #72#return; {34#true} is VALID [2022-04-15 13:30:57,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret6 := main(); {34#true} is VALID [2022-04-15 13:30:57,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#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; {34#true} is VALID [2022-04-15 13:30:57,681 INFO L272 TraceCheckUtils]: 6: Hoare triple {34#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-15 13:30:57,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35#false} {34#true} #60#return; {35#false} is VALID [2022-04-15 13:30:57,683 INFO L272 TraceCheckUtils]: 11: Hoare triple {35#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {34#true} is VALID [2022-04-15 13:30:57,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,684 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35#false} {35#false} #62#return; {35#false} is VALID [2022-04-15 13:30:57,684 INFO L272 TraceCheckUtils]: 16: Hoare triple {35#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {34#true} is VALID [2022-04-15 13:30:57,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,686 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {35#false} {35#false} #64#return; {35#false} is VALID [2022-04-15 13:30:57,686 INFO L272 TraceCheckUtils]: 21: Hoare triple {35#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {34#true} is VALID [2022-04-15 13:30:57,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#true} ~cond := #in~cond; {34#true} is VALID [2022-04-15 13:30:57,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {34#true} assume 0 == ~cond;assume false; {35#false} is VALID [2022-04-15 13:30:57,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#false} assume true; {35#false} is VALID [2022-04-15 13:30:57,687 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {35#false} {35#false} #66#return; {35#false} is VALID [2022-04-15 13:30:57,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {35#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {35#false} is VALID [2022-04-15 13:30:57,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-15 13:30:57,688 INFO L272 TraceCheckUtils]: 28: Hoare triple {35#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {35#false} is VALID [2022-04-15 13:30:57,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-15 13:30:57,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-15 13:30:57,689 INFO L290 TraceCheckUtils]: 31: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-15 13:30:57,689 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 13:30:57,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:57,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127966555] [2022-04-15 13:30:57,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127966555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:57,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:57,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:30:57,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:57,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1399264091] [2022-04-15 13:30:57,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1399264091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:57,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:57,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:30:57,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705751659] [2022-04-15 13:30:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:57,700 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 13:30:57,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:57,705 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 13:30:57,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:57,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:30:57,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:57,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:30:57,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:30:57,760 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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 13:30:57,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:57,950 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-15 13:30:57,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:30:57,951 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 13:30:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:57,953 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 13:30:57,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-15 13:30:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 13:30:57,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2022-04-15 13:30:57,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2022-04-15 13:30:58,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:58,122 INFO L225 Difference]: With dead ends: 55 [2022-04-15 13:30:58,122 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:30:58,126 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 13:30:58,134 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:58,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:30:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:30:58,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:30:58,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:58,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 13:30:58,186 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 13:30:58,187 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 13:30:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:58,192 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:30:58,192 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:30:58,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:58,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:58,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 26 states. [2022-04-15 13:30:58,194 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 26 states. [2022-04-15 13:30:58,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:58,204 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-04-15 13:30:58,204 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:30:58,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:58,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:58,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:58,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 13:30:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 13:30:58,210 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 32 [2022-04-15 13:30:58,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:58,210 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 13:30:58,211 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 13:30:58,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 13:30:58,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 13:30:58,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:30:58,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:58,253 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 13:30:58,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:30:58,254 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:58,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1510033502, now seen corresponding path program 1 times [2022-04-15 13:30:58,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840750028] [2022-04-15 13:30:58,262 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:58,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1510033502, now seen corresponding path program 2 times [2022-04-15 13:30:58,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:58,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156320806] [2022-04-15 13:30:58,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:58,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:58,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:58,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [822563764] [2022-04-15 13:30:58,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:30:58,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:58,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:58,331 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:58,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:30:58,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 13:30:58,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:30:58,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:30:58,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:30:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:30:58,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {272#true} call ULTIMATE.init(); {272#true} is VALID [2022-04-15 13:30:58,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#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(50, 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); {272#true} is VALID [2022-04-15 13:30:58,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {272#true} assume true; {272#true} is VALID [2022-04-15 13:30:58,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {272#true} {272#true} #72#return; {272#true} is VALID [2022-04-15 13:30:58,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {272#true} call #t~ret6 := main(); {272#true} is VALID [2022-04-15 13:30:58,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {272#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; {272#true} is VALID [2022-04-15 13:30:58,982 INFO L272 TraceCheckUtils]: 6: Hoare triple {272#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {272#true} is VALID [2022-04-15 13:30:58,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-04-15 13:30:58,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-04-15 13:30:58,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {272#true} assume true; {272#true} is VALID [2022-04-15 13:30:58,983 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {272#true} {272#true} #60#return; {272#true} is VALID [2022-04-15 13:30:58,983 INFO L272 TraceCheckUtils]: 11: Hoare triple {272#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {272#true} is VALID [2022-04-15 13:30:58,983 INFO L290 TraceCheckUtils]: 12: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-04-15 13:30:58,983 INFO L290 TraceCheckUtils]: 13: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-04-15 13:30:58,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {272#true} assume true; {272#true} is VALID [2022-04-15 13:30:58,984 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {272#true} {272#true} #62#return; {272#true} is VALID [2022-04-15 13:30:58,984 INFO L272 TraceCheckUtils]: 16: Hoare triple {272#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {272#true} is VALID [2022-04-15 13:30:58,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-04-15 13:30:58,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-04-15 13:30:58,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {272#true} assume true; {272#true} is VALID [2022-04-15 13:30:58,985 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {272#true} {272#true} #64#return; {272#true} is VALID [2022-04-15 13:30:58,988 INFO L272 TraceCheckUtils]: 21: Hoare triple {272#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {272#true} is VALID [2022-04-15 13:30:58,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {272#true} ~cond := #in~cond; {272#true} is VALID [2022-04-15 13:30:58,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {272#true} assume !(0 == ~cond); {272#true} is VALID [2022-04-15 13:30:58,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {272#true} assume true; {272#true} is VALID [2022-04-15 13:30:58,989 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {272#true} {272#true} #66#return; {272#true} is VALID [2022-04-15 13:30:58,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {272#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {355#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 13:30:58,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {355#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} assume !false; {355#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 13:30:58,993 INFO L272 TraceCheckUtils]: 28: Hoare triple {355#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~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 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {362#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 13:30:58,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {362#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {366#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 13:30:58,994 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {273#false} is VALID [2022-04-15 13:30:58,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {273#false} assume !false; {273#false} is VALID [2022-04-15 13:30:58,995 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 13:30:58,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:30:58,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:30:58,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156320806] [2022-04-15 13:30:58,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:30:58,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822563764] [2022-04-15 13:30:58,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822563764] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:58,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:58,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:58,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:30:58,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840750028] [2022-04-15 13:30:58,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840750028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:30:58,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:30:59,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:30:59,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416649531] [2022-04-15 13:30:59,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:30:59,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 32 [2022-04-15 13:30:59,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:30:59,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 13:30:59,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:59,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:30:59,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:59,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:30:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:30:59,029 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 13:30:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:59,247 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-15 13:30:59,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:30:59,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 32 [2022-04-15 13:30:59,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:30:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 13:30:59,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 13:30:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 13:30:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-15 13:30:59,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-15 13:30:59,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:59,306 INFO L225 Difference]: With dead ends: 37 [2022-04-15 13:30:59,306 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 13:30:59,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:30:59,307 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:30:59,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:30:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 13:30:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 13:30:59,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:30:59,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:59,319 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:59,320 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:59,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:59,322 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 13:30:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-15 13:30:59,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:59,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:59,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 34 states. [2022-04-15 13:30:59,324 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 34 states. [2022-04-15 13:30:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:30:59,327 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-15 13:30:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-15 13:30:59,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:30:59,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:30:59,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:30:59,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:30:59,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 20 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 13:30:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-15 13:30:59,330 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 32 [2022-04-15 13:30:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:30:59,331 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-15 13:30:59,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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 13:30:59,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 38 transitions. [2022-04-15 13:30:59,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:30:59,381 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 13:30:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 13:30:59,382 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:30:59,382 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 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 13:30:59,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:30:59,587 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 13:30:59,587 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:30:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:30:59,588 INFO L85 PathProgramCache]: Analyzing trace with hash 905413410, now seen corresponding path program 1 times [2022-04-15 13:30:59,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:30:59,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254733748] [2022-04-15 13:30:59,589 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:30:59,589 INFO L85 PathProgramCache]: Analyzing trace with hash 905413410, now seen corresponding path program 2 times [2022-04-15 13:30:59,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:30:59,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33455159] [2022-04-15 13:30:59,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:30:59,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:30:59,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:30:59,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [241668226] [2022-04-15 13:30:59,641 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:30:59,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:30:59,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:30:59,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:30:59,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process