/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/lcm2_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 13:40:19,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 13:40:19,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 13:40:19,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 13:40:19,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 13:40:19,402 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 13:40:19,403 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 13:40:19,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 13:40:19,406 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 13:40:19,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 13:40:19,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 13:40:19,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 13:40:19,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 13:40:19,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 13:40:19,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 13:40:19,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 13:40:19,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 13:40:19,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 13:40:19,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 13:40:19,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 13:40:19,413 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 13:40:19,414 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 13:40:19,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 13:40:19,415 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 13:40:19,415 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 13:40:19,417 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 13:40:19,417 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 13:40:19,417 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 13:40:19,418 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 13:40:19,418 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 13:40:19,419 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 13:40:19,419 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 13:40:19,419 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 13:40:19,420 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 13:40:19,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 13:40:19,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 13:40:19,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 13:40:19,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 13:40:19,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 13:40:19,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 13:40:19,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 13:40:19,427 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 13:40:19,428 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 13:40:19,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 13:40:19,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 13:40:19,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 13:40:19,434 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 13:40:19,434 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 13:40:19,434 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 13:40:19,435 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:40:19,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 13:40:19,435 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 13:40:19,436 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 13:40:19,436 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 13:40:19,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 13:40:19,436 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 13:40:19,436 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-08 13:40:19,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 13:40:19,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 13:40:19,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 13:40:19,632 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 13:40:19,632 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 13:40:19,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound2.c [2022-04-08 13:40:19,673 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd04b73a9/3bd6bf68ebd842849da73013de8e1bcb/FLAGd2020bad3 [2022-04-08 13:40:20,025 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 13:40:20,026 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_unwindbound2.c [2022-04-08 13:40:20,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd04b73a9/3bd6bf68ebd842849da73013de8e1bcb/FLAGd2020bad3 [2022-04-08 13:40:20,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd04b73a9/3bd6bf68ebd842849da73013de8e1bcb [2022-04-08 13:40:20,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 13:40:20,044 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 13:40:20,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 13:40:20,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 13:40:20,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 13:40:20,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7041b942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20, skipping insertion in model container [2022-04-08 13:40:20,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 13:40:20,065 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 13:40:20,202 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/lcm2_unwindbound2.c[537,550] [2022-04-08 13:40:20,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:40:20,230 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 13:40:20,241 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/lcm2_unwindbound2.c[537,550] [2022-04-08 13:40:20,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:40:20,265 INFO L208 MainTranslator]: Completed translation [2022-04-08 13:40:20,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20 WrapperNode [2022-04-08 13:40:20,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 13:40:20,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 13:40:20,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 13:40:20,266 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 13:40:20,273 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,294 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 13:40:20,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 13:40:20,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 13:40:20,301 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 13:40:20,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (1/1) ... [2022-04-08 13:40:20,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:40:20,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:40:20,321 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-08 13:40:20,335 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-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 13:40:20,350 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 13:40:20,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 13:40:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 13:40:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 13:40:20,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 13:40:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 13:40:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 13:40:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 13:40:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 13:40:20,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 13:40:20,401 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 13:40:20,403 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 13:40:20,554 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 13:40:20,558 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 13:40:20,558 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 13:40:20,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:40:20 BoogieIcfgContainer [2022-04-08 13:40:20,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 13:40:20,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 13:40:20,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 13:40:20,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 13:40:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:40:20" (1/3) ... [2022-04-08 13:40:20,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c7621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:40:20, skipping insertion in model container [2022-04-08 13:40:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:40:20" (2/3) ... [2022-04-08 13:40:20,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@141c7621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:40:20, skipping insertion in model container [2022-04-08 13:40:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:40:20" (3/3) ... [2022-04-08 13:40:20,564 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_unwindbound2.c [2022-04-08 13:40:20,567 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 13:40:20,567 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 13:40:20,598 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 13:40:20,604 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-08 13:40:20,605 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 13:40:20,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-08 13:40:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 13:40:20,630 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:40:20,630 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-08 13:40:20,630 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:40:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:40:20,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 1 times [2022-04-08 13:40:20,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:20,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371688690] [2022-04-08 13:40:20,652 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:40:20,652 INFO L85 PathProgramCache]: Analyzing trace with hash 2009995470, now seen corresponding path program 2 times [2022-04-08 13:40:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:40:20,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575455836] [2022-04-08 13:40:20,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:40:20,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:40:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:40:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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(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);~counter~0 := 0; {35#true} is VALID [2022-04-08 13:40:20,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 13:40:20,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-08 13:40:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 13:40:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 13:40:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 13:40:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 13:40:20,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-08 13:40:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,881 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 13:40:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-08 13:40:20,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:20,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-08 13:40:20,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:40:20,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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(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);~counter~0 := 0; {35#true} is VALID [2022-04-08 13:40:20,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 13:40:20,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-08 13:40:20,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-08 13:40:20,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#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; {35#true} is VALID [2022-04-08 13:40:20,895 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 13:40:20,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,895 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 13:40:20,896 INFO L272 TraceCheckUtils]: 11: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 13:40:20,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,896 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 13:40:20,896 INFO L272 TraceCheckUtils]: 16: Hoare triple {36#false} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID [2022-04-08 13:40:20,897 INFO L290 TraceCheckUtils]: 17: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,898 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 13:40:20,898 INFO L272 TraceCheckUtils]: 21: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {35#true} is VALID [2022-04-08 13:40:20,898 INFO L290 TraceCheckUtils]: 22: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:40:20,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:40:20,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:40:20,900 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-08 13:40:20,900 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {36#false} is VALID [2022-04-08 13:40:20,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-08 13:40:20,901 INFO L272 TraceCheckUtils]: 28: Hoare triple {36#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {36#false} is VALID [2022-04-08 13:40:20,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 13:40:20,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 13:40:20,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 13:40:20,902 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-08 13:40:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:40:20,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575455836] [2022-04-08 13:40:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575455836] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:20,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:20,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:40:20,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:40:20,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371688690] [2022-04-08 13:40:20,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371688690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:20,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:20,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:40:20,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407340359] [2022-04-08 13:40:20,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:40:20,910 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-08 13:40:20,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:40:20,913 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-08 13:40:20,955 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-08 13:40:20,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 13:40:20,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:20,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 13:40:20,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:40:20,982 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-08 13:40:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,137 INFO L93 Difference]: Finished difference Result 58 states and 82 transitions. [2022-04-08 13:40:21,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 13:40:21,138 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-08 13:40:21,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:40:21,139 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-08 13:40:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-08 13:40:21,147 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-08 13:40:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-04-08 13:40:21,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-04-08 13:40:21,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:21,240 INFO L225 Difference]: With dead ends: 58 [2022-04-08 13:40:21,240 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 13:40:21,242 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-08 13:40:21,245 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:40:21,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:40:21,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 13:40:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-08 13:40:21,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:40:21,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-08 13:40:21,266 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-08 13:40:21,266 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-08 13:40:21,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,269 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-08 13:40:21,269 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 13:40:21,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:21,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:21,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 28 states. [2022-04-08 13:40:21,271 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 28 states. [2022-04-08 13:40:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,274 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-08 13:40:21,274 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 13:40:21,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:21,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:21,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:40:21,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:40:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-08 13:40:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-08 13:40:21,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 32 [2022-04-08 13:40:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:40:21,278 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-08 13:40:21,278 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-08 13:40:21,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-08 13:40:21,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 13:40:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 13:40:21,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:40:21,327 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-08 13:40:21,327 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 13:40:21,327 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:40:21,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:40:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 1 times [2022-04-08 13:40:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1028584339] [2022-04-08 13:40:21,328 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:40:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -756409738, now seen corresponding path program 2 times [2022-04-08 13:40:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:40:21,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784667272] [2022-04-08 13:40:21,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:40:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:40:21,345 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:40:21,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137763978] [2022-04-08 13:40:21,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:40:21,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:40:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:40:21,359 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-08 13:40:21,360 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-08 13:40:21,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 13:40:21,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:40:21,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 13:40:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:21,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:40:21,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {285#true} call ULTIMATE.init(); {285#true} is VALID [2022-04-08 13:40:21,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#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);~counter~0 := 0; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {293#(<= ~counter~0 0)} {285#true} #73#return; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {293#(<= ~counter~0 0)} call #t~ret7 := main(); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {293#(<= ~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; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #61#return; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,680 INFO L272 TraceCheckUtils]: 11: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #63#return; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,682 INFO L272 TraceCheckUtils]: 16: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,685 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #65#return; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,685 INFO L272 TraceCheckUtils]: 21: Hoare triple {293#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {293#(<= ~counter~0 0)} ~cond := #in~cond; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {293#(<= ~counter~0 0)} assume !(0 == ~cond); {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {293#(<= ~counter~0 0)} assume true; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,690 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {293#(<= ~counter~0 0)} {293#(<= ~counter~0 0)} #67#return; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {293#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {293#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:21,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {293#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {372#(<= |main_#t~post6| 0)} is VALID [2022-04-08 13:40:21,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {372#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {286#false} is VALID [2022-04-08 13:40:21,692 INFO L272 TraceCheckUtils]: 29: Hoare triple {286#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {286#false} is VALID [2022-04-08 13:40:21,692 INFO L290 TraceCheckUtils]: 30: Hoare triple {286#false} ~cond := #in~cond; {286#false} is VALID [2022-04-08 13:40:21,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {286#false} assume 0 == ~cond; {286#false} is VALID [2022-04-08 13:40:21,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {286#false} assume !false; {286#false} is VALID [2022-04-08 13:40:21,693 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-08 13:40:21,693 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:40:21,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:40:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784667272] [2022-04-08 13:40:21,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:40:21,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137763978] [2022-04-08 13:40:21,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137763978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:21,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:21,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:40:21,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:40:21,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1028584339] [2022-04-08 13:40:21,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1028584339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:21,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:21,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:40:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857679979] [2022-04-08 13:40:21,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:40:21,697 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-08 13:40:21,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:40:21,699 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-08 13:40:21,718 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-08 13:40:21,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 13:40:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 13:40:21,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 13:40:21,722 INFO L87 Difference]: Start difference. First operand 27 states and 33 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-08 13:40:21,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,800 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-04-08 13:40:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 13:40:21,801 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-08 13:40:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:40:21,802 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-08 13:40:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-08 13:40:21,811 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-08 13:40:21,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 42 transitions. [2022-04-08 13:40:21,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 42 transitions. [2022-04-08 13:40:21,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:21,846 INFO L225 Difference]: With dead ends: 36 [2022-04-08 13:40:21,846 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 13:40:21,847 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-08 13:40:21,851 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:40:21,855 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:40:21,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 13:40:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 13:40:21,866 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:40:21,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-08 13:40:21,866 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-08 13:40:21,867 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-08 13:40:21,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,868 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 13:40:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:40:21,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:21,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:21,869 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 29 states. [2022-04-08 13:40:21,869 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 29 states. [2022-04-08 13:40:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:21,871 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 13:40:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:40:21,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:21,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:21,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:40:21,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:40:21,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-08 13:40:21,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 13:40:21,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 33 [2022-04-08 13:40:21,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:40:21,875 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 13:40:21,876 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-08 13:40:21,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-08 13:40:21,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:40:21,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 13:40:21,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:40:21,912 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-08 13:40:21,932 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-08 13:40:22,127 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-08 13:40:22,128 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:40:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:40:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 1 times [2022-04-08 13:40:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:22,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1849347178] [2022-04-08 13:40:22,129 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:40:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash -754622278, now seen corresponding path program 2 times [2022-04-08 13:40:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:40:22,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258550676] [2022-04-08 13:40:22,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:40:22,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:40:22,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:40:22,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931774938] [2022-04-08 13:40:22,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:40:22,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:40:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:40:22,152 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-08 13:40:22,152 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-08 13:40:22,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 13:40:22,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:40:22,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:40:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:22,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:40:22,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {575#true} call ULTIMATE.init(); {575#true} is VALID [2022-04-08 13:40:22,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {575#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);~counter~0 := 0; {575#true} is VALID [2022-04-08 13:40:22,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-08 13:40:22,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {575#true} {575#true} #73#return; {575#true} is VALID [2022-04-08 13:40:22,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {575#true} call #t~ret7 := main(); {575#true} is VALID [2022-04-08 13:40:22,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {575#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; {575#true} is VALID [2022-04-08 13:40:22,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {575#true} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {575#true} is VALID [2022-04-08 13:40:22,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-08 13:40:22,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-08 13:40:22,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-08 13:40:22,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {575#true} {575#true} #61#return; {575#true} is VALID [2022-04-08 13:40:22,584 INFO L272 TraceCheckUtils]: 11: Hoare triple {575#true} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {575#true} is VALID [2022-04-08 13:40:22,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-08 13:40:22,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-08 13:40:22,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-08 13:40:22,585 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {575#true} {575#true} #63#return; {575#true} is VALID [2022-04-08 13:40:22,585 INFO L272 TraceCheckUtils]: 16: Hoare triple {575#true} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {575#true} is VALID [2022-04-08 13:40:22,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-08 13:40:22,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-08 13:40:22,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-08 13:40:22,587 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {575#true} {575#true} #65#return; {575#true} is VALID [2022-04-08 13:40:22,587 INFO L272 TraceCheckUtils]: 21: Hoare triple {575#true} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {575#true} is VALID [2022-04-08 13:40:22,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {575#true} ~cond := #in~cond; {575#true} is VALID [2022-04-08 13:40:22,587 INFO L290 TraceCheckUtils]: 23: Hoare triple {575#true} assume !(0 == ~cond); {575#true} is VALID [2022-04-08 13:40:22,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {575#true} assume true; {575#true} is VALID [2022-04-08 13:40:22,588 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {575#true} {575#true} #67#return; {575#true} is VALID [2022-04-08 13:40:22,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {575#true} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {658#(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-08 13:40:22,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {658#(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))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {658#(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-08 13:40:22,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {658#(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 !!(#t~post6 < 2);havoc #t~post6; {658#(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-08 13:40:22,590 INFO L272 TraceCheckUtils]: 29: Hoare triple {658#(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)); {668#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:40:22,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {668#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {672#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:40:22,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {672#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {576#false} is VALID [2022-04-08 13:40:22,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {576#false} assume !false; {576#false} is VALID [2022-04-08 13:40:22,593 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-08 13:40:22,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:40:22,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:40:22,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258550676] [2022-04-08 13:40:22,593 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:40:22,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931774938] [2022-04-08 13:40:22,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931774938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:22,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:22,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:40:22,594 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:40:22,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1849347178] [2022-04-08 13:40:22,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1849347178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:22,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:22,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:40:22,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871761548] [2022-04-08 13:40:22,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:40:22,595 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-08 13:40:22,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:40:22,595 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-08 13:40:22,614 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-08 13:40:22,616 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:40:22,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:22,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:40:22,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:40:22,617 INFO L87 Difference]: Start difference. First operand 29 states and 35 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-08 13:40:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:22,763 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-04-08 13:40:22,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:40:22,763 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-08 13:40:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:40:22,764 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-08 13:40:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 13:40:22,765 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-08 13:40:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-08 13:40:22,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-08 13:40:22,808 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-08 13:40:22,809 INFO L225 Difference]: With dead ends: 39 [2022-04-08 13:40:22,809 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 13:40:22,809 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-08 13:40:22,810 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:40:22,810 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:40:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 13:40:22,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-08 13:40:22,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:40:22,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-08 13:40:22,829 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-08 13:40:22,829 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-08 13:40:22,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:22,834 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 13:40:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 13:40:22,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:22,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:22,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 36 states. [2022-04-08 13:40:22,836 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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 36 states. [2022-04-08 13:40:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:22,842 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 13:40:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 13:40:22,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:22,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:22,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:40:22,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:40:22,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 22 states have internal predecessors, (25), 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-08 13:40:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-04-08 13:40:22,847 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 33 [2022-04-08 13:40:22,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:40:22,848 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-04-08 13:40:22,848 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-08 13:40:22,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 41 transitions. [2022-04-08 13:40:22,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:22,894 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-08 13:40:22,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 13:40:22,895 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:40:22,896 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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, 1] [2022-04-08 13:40:22,904 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-08 13:40:23,099 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-08 13:40:23,100 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:40:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:40:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 1 times [2022-04-08 13:40:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:23,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050115098] [2022-04-08 13:40:23,101 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:40:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 756635198, now seen corresponding path program 2 times [2022-04-08 13:40:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:40:23,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020862138] [2022-04-08 13:40:23,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:40:23,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:40:23,119 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:40:23,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212093670] [2022-04-08 13:40:23,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:40:23,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:40:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:40:23,120 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-08 13:40:23,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 13:40:23,165 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:40:23,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:40:23,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:40:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:40:23,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:40:23,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 13:40:23,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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);~counter~0 := 0; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {908#(<= ~counter~0 0)} {900#true} #73#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {908#(<= ~counter~0 0)} call #t~ret7 := main(); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {908#(<= ~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; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,370 INFO L272 TraceCheckUtils]: 6: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #61#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,372 INFO L272 TraceCheckUtils]: 11: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,373 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #63#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,373 INFO L272 TraceCheckUtils]: 16: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,375 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #65#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,375 INFO L272 TraceCheckUtils]: 21: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#(<= ~counter~0 0)} ~cond := #in~cond; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {908#(<= ~counter~0 0)} assume !(0 == ~cond); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,381 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {908#(<= ~counter~0 0)} {908#(<= ~counter~0 0)} #67#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {908#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {987#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,382 INFO L272 TraceCheckUtils]: 29: Hoare triple {987#(<= ~counter~0 1)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,383 INFO L290 TraceCheckUtils]: 30: Hoare triple {987#(<= ~counter~0 1)} ~cond := #in~cond; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {987#(<= ~counter~0 1)} assume !(0 == ~cond); {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {987#(<= ~counter~0 1)} assume true; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,384 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {987#(<= ~counter~0 1)} {987#(<= ~counter~0 1)} #69#return; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,384 INFO L290 TraceCheckUtils]: 34: Hoare triple {987#(<= ~counter~0 1)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {987#(<= ~counter~0 1)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {987#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1015#(<= |main_#t~post6| 1)} is VALID [2022-04-08 13:40:23,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {1015#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {901#false} is VALID [2022-04-08 13:40:23,386 INFO L272 TraceCheckUtils]: 38: Hoare triple {901#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {901#false} is VALID [2022-04-08 13:40:23,386 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2022-04-08 13:40:23,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID [2022-04-08 13:40:23,386 INFO L290 TraceCheckUtils]: 41: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 13:40:23,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 13:40:23,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:40:23,544 INFO L290 TraceCheckUtils]: 41: Hoare triple {901#false} assume !false; {901#false} is VALID [2022-04-08 13:40:23,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {901#false} assume 0 == ~cond; {901#false} is VALID [2022-04-08 13:40:23,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {901#false} ~cond := #in~cond; {901#false} is VALID [2022-04-08 13:40:23,545 INFO L272 TraceCheckUtils]: 38: Hoare triple {901#false} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {901#false} is VALID [2022-04-08 13:40:23,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {1015#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {901#false} is VALID [2022-04-08 13:40:23,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {987#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1015#(<= |main_#t~post6| 1)} is VALID [2022-04-08 13:40:23,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {987#(<= ~counter~0 1)} assume ~x~0 % 4294967296 > ~y~0 % 4294967296;~x~0 := ~x~0 - ~y~0;~v~0 := ~v~0 + ~u~0; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {987#(<= ~counter~0 1)} assume !!(~x~0 % 4294967296 != ~y~0 % 4294967296); {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,547 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {900#true} {987#(<= ~counter~0 1)} #69#return; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 13:40:23,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 13:40:23,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 13:40:23,547 INFO L272 TraceCheckUtils]: 29: Hoare triple {987#(<= ~counter~0 1)} call __VERIFIER_assert((if (~x~0 * ~u~0 + ~y~0 * ~v~0) % 4294967296 == 2 * ~a~0 * ~b~0 % 4294967296 then 1 else 0)); {900#true} is VALID [2022-04-08 13:40:23,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {987#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {908#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {987#(<= ~counter~0 1)} is VALID [2022-04-08 13:40:23,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {908#(<= ~counter~0 0)} ~x~0 := ~a~0;~y~0 := ~b~0;~u~0 := ~b~0;~v~0 := ~a~0; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,549 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {900#true} {908#(<= ~counter~0 0)} #67#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 13:40:23,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 13:40:23,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 13:40:23,549 INFO L272 TraceCheckUtils]: 21: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 <= 65535 then 1 else 0)); {900#true} is VALID [2022-04-08 13:40:23,550 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {900#true} {908#(<= ~counter~0 0)} #65#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 13:40:23,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 13:40:23,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 13:40:23,550 INFO L272 TraceCheckUtils]: 16: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 <= 65535 then 1 else 0)); {900#true} is VALID [2022-04-08 13:40:23,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {900#true} {908#(<= ~counter~0 0)} #63#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 13:40:23,551 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 13:40:23,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 13:40:23,551 INFO L272 TraceCheckUtils]: 11: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~b~0 % 4294967296 >= 1 then 1 else 0)); {900#true} is VALID [2022-04-08 13:40:23,552 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {900#true} {908#(<= ~counter~0 0)} #61#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,552 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#true} assume true; {900#true} is VALID [2022-04-08 13:40:23,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#true} assume !(0 == ~cond); {900#true} is VALID [2022-04-08 13:40:23,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#true} ~cond := #in~cond; {900#true} is VALID [2022-04-08 13:40:23,552 INFO L272 TraceCheckUtils]: 6: Hoare triple {908#(<= ~counter~0 0)} call assume_abort_if_not((if ~a~0 % 4294967296 >= 1 then 1 else 0)); {900#true} is VALID [2022-04-08 13:40:23,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {908#(<= ~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; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {908#(<= ~counter~0 0)} call #t~ret7 := main(); {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {908#(<= ~counter~0 0)} {900#true} #73#return; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {908#(<= ~counter~0 0)} assume true; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {900#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);~counter~0 := 0; {908#(<= ~counter~0 0)} is VALID [2022-04-08 13:40:23,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {900#true} call ULTIMATE.init(); {900#true} is VALID [2022-04-08 13:40:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 13:40:23,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:40:23,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020862138] [2022-04-08 13:40:23,555 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:40:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212093670] [2022-04-08 13:40:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212093670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:40:23,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:40:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 13:40:23,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:40:23,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050115098] [2022-04-08 13:40:23,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050115098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:40:23,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:40:23,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:40:23,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488127179] [2022-04-08 13:40:23,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:40:23,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 13:40:23,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:40:23,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 13:40:23,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:23,579 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:40:23,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:23,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:40:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:40:23,579 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 13:40:23,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:23,688 INFO L93 Difference]: Finished difference Result 45 states and 52 transitions. [2022-04-08 13:40:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:40:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-08 13:40:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:40:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 13:40:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 13:40:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 13:40:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2022-04-08 13:40:23,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 52 transitions. [2022-04-08 13:40:23,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:23,725 INFO L225 Difference]: With dead ends: 45 [2022-04-08 13:40:23,725 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 13:40:23,726 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:40:23,726 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:40:23,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:40:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 13:40:23,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 13:40:23,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:40:23,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-08 13:40:23,744 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-08 13:40:23,744 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-08 13:40:23,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:23,746 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 13:40:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 13:40:23,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:23,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:23,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 38 states. [2022-04-08 13:40:23,746 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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 38 states. [2022-04-08 13:40:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:40:23,748 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 13:40:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 13:40:23,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:40:23,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:40:23,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:40:23,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:40:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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-08 13:40:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-08 13:40:23,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 42 [2022-04-08 13:40:23,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:40:23,750 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-08 13:40:23,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (8), 4 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 13:40:23,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 45 transitions. [2022-04-08 13:40:23,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:40:23,783 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-08 13:40:23,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-08 13:40:23,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:40:23,784 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 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-08 13:40:23,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 13:40:24,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:40:24,000 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:40:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:40:24,000 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 1 times [2022-04-08 13:40:24,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:40:24,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2034572914] [2022-04-08 13:40:24,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:40:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 758422658, now seen corresponding path program 2 times [2022-04-08 13:40:24,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:40:24,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475655136] [2022-04-08 13:40:24,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:40:24,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:40:24,017 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:40:24,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1637379057] [2022-04-08 13:40:24,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:40:24,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:40:24,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:40:24,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:40:24,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process