/usr/bin/java -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/geo3-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 22:53:32,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 22:53:32,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 22:53:32,408 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 22:53:32,408 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 22:53:32,409 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 22:53:32,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 22:53:32,415 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 22:53:32,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 22:53:32,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 22:53:32,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 22:53:32,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 22:53:32,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 22:53:32,427 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 22:53:32,428 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 22:53:32,429 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 22:53:32,430 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 22:53:32,431 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 22:53:32,434 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 22:53:32,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 22:53:32,442 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 22:53:32,443 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 22:53:32,443 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 22:53:32,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 22:53:32,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 22:53:32,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 22:53:32,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 22:53:32,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 22:53:32,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 22:53:32,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 22:53:32,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 22:53:32,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 22:53:32,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 22:53:32,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 22:53:32,456 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 22:53:32,456 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 22:53:32,457 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 22:53:32,457 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 22:53:32,457 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 22:53:32,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 22:53:32,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 22:53:32,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 22:53:32,463 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-06 22:53:32,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 22:53:32,474 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 22:53:32,475 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 22:53:32,475 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 22:53:32,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 22:53:32,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 22:53:32,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 22:53:32,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 22:53:32,476 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 22:53:32,476 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 22:53:32,476 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 22:53:32,477 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 22:53:32,477 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-06 22:53:32,477 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-06 22:53:32,478 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-06 22:53:32,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 22:53:32,478 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-06 22:53:32,478 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-06 22:53:32,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 22:53:32,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 22:53:32,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 22:53:32,736 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 22:53:32,737 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 22:53:32,738 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-06 22:53:32,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba4511ce9/7eac26608e8a423d9f2944a96affb160/FLAGdb6c73c3b [2022-04-06 22:53:33,141 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 22:53:33,142 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound50.c [2022-04-06 22:53:33,146 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba4511ce9/7eac26608e8a423d9f2944a96affb160/FLAGdb6c73c3b [2022-04-06 22:53:33,156 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba4511ce9/7eac26608e8a423d9f2944a96affb160 [2022-04-06 22:53:33,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 22:53:33,159 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-06 22:53:33,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 22:53:33,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 22:53:33,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 22:53:33,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c297341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33, skipping insertion in model container [2022-04-06 22:53:33,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 22:53:33,179 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 22:53:33,313 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/geo3-ll_unwindbound50.c[525,538] [2022-04-06 22:53:33,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 22:53:33,337 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 22:53:33,349 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/geo3-ll_unwindbound50.c[525,538] [2022-04-06 22:53:33,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 22:53:33,374 INFO L208 MainTranslator]: Completed translation [2022-04-06 22:53:33,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33 WrapperNode [2022-04-06 22:53:33,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 22:53:33,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 22:53:33,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 22:53:33,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 22:53:33,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,403 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,408 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 22:53:33,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 22:53:33,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 22:53:33,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 22:53:33,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (1/1) ... [2022-04-06 22:53:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 22:53:33,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:33,440 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-06 22:53:33,463 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-06 22:53:33,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 22:53:33,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 22:53:33,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 22:53:33,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 22:53:33,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 22:53:33,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 22:53:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 22:53:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 22:53:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 22:53:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 22:53:33,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 22:53:33,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 22:53:33,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 22:53:33,532 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 22:53:33,535 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 22:53:33,639 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 22:53:33,644 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 22:53:33,644 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 22:53:33,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:53:33 BoogieIcfgContainer [2022-04-06 22:53:33,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 22:53:33,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 22:53:33,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 22:53:33,649 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 22:53:33,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 10:53:33" (1/3) ... [2022-04-06 22:53:33,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237a67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:53:33, skipping insertion in model container [2022-04-06 22:53:33,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 10:53:33" (2/3) ... [2022-04-06 22:53:33,651 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237a67f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 10:53:33, skipping insertion in model container [2022-04-06 22:53:33,651 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 10:53:33" (3/3) ... [2022-04-06 22:53:33,652 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound50.c [2022-04-06 22:53:33,656 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-06 22:53:33,656 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 22:53:33,688 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 22:53:33,694 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-06 22:53:33,694 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 22:53:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 22:53:33,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-06 22:53:33,710 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:33,711 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:33,711 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:33,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-06 22:53:33,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1389870701] [2022-04-06 22:53:33,731 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-06 22:53:33,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:33,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585341719] [2022-04-06 22:53:33,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:33,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:33,805 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:33,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134730324] [2022-04-06 22:53:33,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:33,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:33,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:33,811 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-06 22:53:33,816 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-06 22:53:33,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:33,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:33,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-06 22:53:33,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:33,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:33,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:33,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:33,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585341719] [2022-04-06 22:53:33,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134730324] [2022-04-06 22:53:33,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134730324] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:33,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:33,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 22:53:33,985 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:33,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1389870701] [2022-04-06 22:53:33,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1389870701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:33,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:33,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-06 22:53:33,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103578307] [2022-04-06 22:53:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:33,989 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-06 22:53:33,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-06 22:53:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 22:53:34,017 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:34,032 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-06 22:53:34,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-06 22:53:34,033 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-06 22:53:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:34,039 INFO L225 Difference]: With dead ends: 38 [2022-04-06 22:53:34,040 INFO L226 Difference]: Without dead ends: 17 [2022-04-06 22:53:34,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-06 22:53:34,047 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:34,049 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-06 22:53:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-06 22:53:34,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-06 22:53:34,085 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-06 22:53:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:34,085 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-06 22:53:34,086 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-06 22:53:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 22:53:34,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:34,087 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:34,112 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-06 22:53:34,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-06 22:53:34,296 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:34,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-06 22:53:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:34,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056623883] [2022-04-06 22:53:34,298 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-06 22:53:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:34,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876632950] [2022-04-06 22:53:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:34,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:34,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2057686424] [2022-04-06 22:53:34,311 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:34,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:34,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:34,312 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-06 22:53:34,317 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-06 22:53:34,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:34,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:34,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 22:53:34,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:34,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:34,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:34,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876632950] [2022-04-06 22:53:34,446 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:34,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057686424] [2022-04-06 22:53:34,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057686424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:34,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:34,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 22:53:34,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:34,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056623883] [2022-04-06 22:53:34,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056623883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:34,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:34,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 22:53:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910546274] [2022-04-06 22:53:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:34,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 22:53:34,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:34,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 22:53:34,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 22:53:34,450 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:34,462 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-06 22:53:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 22:53:34,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-06 22:53:34,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:34,463 INFO L225 Difference]: With dead ends: 26 [2022-04-06 22:53:34,463 INFO L226 Difference]: Without dead ends: 19 [2022-04-06 22:53:34,463 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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-06 22:53:34,465 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 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-06 22:53:34,465 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:34,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-06 22:53:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-06 22:53:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-06 22:53:34,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-06 22:53:34,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:34,471 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-06 22:53:34,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-06 22:53:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-06 22:53:34,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:34,472 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:34,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-06 22:53:34,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-06 22:53:34,696 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:34,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-06 22:53:34,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:34,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [304403959] [2022-04-06 22:53:34,698 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-06 22:53:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-06 22:53:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:34,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264598611] [2022-04-06 22:53:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:34,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:34,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490038656] [2022-04-06 22:53:34,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:34,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:34,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:34,715 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-06 22:53:34,725 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-06 22:53:34,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-06 22:53:34,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:34,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 22:53:34,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:34,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 22:53:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264598611] [2022-04-06 22:53:34,860 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490038656] [2022-04-06 22:53:34,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490038656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:34,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:34,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:34,861 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:34,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [304403959] [2022-04-06 22:53:34,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [304403959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:34,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:34,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:34,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66606596] [2022-04-06 22:53:34,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:34,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 22:53:34,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:34,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 22:53:34,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-06 22:53:34,863 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:34,897 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-06 22:53:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-06 22:53:34,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-06 22:53:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:34,898 INFO L225 Difference]: With dead ends: 28 [2022-04-06 22:53:34,898 INFO L226 Difference]: Without dead ends: 25 [2022-04-06 22:53:34,899 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-06 22:53:34,900 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:34,900 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:34,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-06 22:53:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-06 22:53:34,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 22:53:34,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-06 22:53:34,922 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-06 22:53:34,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:34,923 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-06 22:53:34,924 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-06 22:53:34,924 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-06 22:53:34,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 22:53:34,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:34,927 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:34,944 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-06 22:53:35,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:35,132 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:35,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-06 22:53:35,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:35,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1785364141] [2022-04-06 22:53:35,150 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:35,150 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:35,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-06 22:53:35,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:35,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104145014] [2022-04-06 22:53:35,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:35,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:35,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:35,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1830877941] [2022-04-06 22:53:35,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:35,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:35,171 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-06 22:53:35,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 22:53:35,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 22:53:35,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 22:53:35,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:35,308 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:35,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:53:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:35,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:35,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104145014] [2022-04-06 22:53:35,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:35,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830877941] [2022-04-06 22:53:35,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830877941] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:53:35,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:53:35,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-06 22:53:35,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:35,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1785364141] [2022-04-06 22:53:35,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1785364141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:35,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:35,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-06 22:53:35,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661518489] [2022-04-06 22:53:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:35,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-06 22:53:35,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-06 22:53:35,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 22:53:35,413 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:35,457 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-06 22:53:35,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-06 22:53:35,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-06 22:53:35,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:35,459 INFO L225 Difference]: With dead ends: 34 [2022-04-06 22:53:35,459 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 22:53:35,460 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-06 22:53:35,460 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:35,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 58 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 22:53:35,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 22:53:35,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-06 22:53:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-06 22:53:35,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-06 22:53:35,466 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-06 22:53:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:35,467 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-06 22:53:35,470 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:35,470 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-06 22:53:35,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-06 22:53:35,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:35,471 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:35,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 22:53:35,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:35,687 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:35,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-06 22:53:35,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:35,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318083509] [2022-04-06 22:53:35,693 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:35,693 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:35,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-06 22:53:35,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:35,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160342757] [2022-04-06 22:53:35,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:35,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:35,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:35,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [236752437] [2022-04-06 22:53:35,702 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 22:53:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:35,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 22:53:35,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 22:53:35,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 22:53:35,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:35,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-06 22:53:35,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:35,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:53:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-06 22:53:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:53:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160342757] [2022-04-06 22:53:36,220 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:53:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236752437] [2022-04-06 22:53:36,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236752437] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:53:36,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:53:36,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-06 22:53:36,221 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:53:36,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318083509] [2022-04-06 22:53:36,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318083509] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:53:36,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:53:36,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 22:53:36,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895103882] [2022-04-06 22:53:36,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:53:36,222 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 22:53:36,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:36,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 22:53:36,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-06 22:53:36,223 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:53:36,441 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-06 22:53:36,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 22:53:36,442 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-06 22:53:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:53:36,443 INFO L225 Difference]: With dead ends: 36 [2022-04-06 22:53:36,443 INFO L226 Difference]: Without dead ends: 33 [2022-04-06 22:53:36,443 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-06 22:53:36,444 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-06 22:53:36,444 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-06 22:53:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-06 22:53:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-06 22:53:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 22:53:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-06 22:53:36,450 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-06 22:53:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:53:36,451 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-06 22:53:36,451 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-06 22:53:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-06 22:53:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-06 22:53:36,451 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:53:36,452 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:53:36,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 22:53:36,652 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:36,653 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:53:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:53:36,653 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-06 22:53:36,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:53:36,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309385259] [2022-04-06 22:53:36,657 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:53:36,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:53:36,657 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-06 22:53:36,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:53:36,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783519966] [2022-04-06 22:53:36,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:53:36,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:53:36,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:53:36,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526760577] [2022-04-06 22:53:36,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 22:53:36,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:53:36,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:53:36,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 22:53:36,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 22:53:37,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 22:53:37,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:53:37,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-06 22:53:37,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:53:37,153 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:37,157 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:37,162 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:53:43,228 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) is different from false [2022-04-06 22:54:34,327 WARN L232 SmtUtils]: Spent 23.65s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 22:54:34,359 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:34,365 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:34,369 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:54:34,385 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:00,344 WARN L232 SmtUtils]: Spent 12.89s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-06 22:55:30,919 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-04-06 22:55:30,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:55:35,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 22:55:35,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:55:35,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783519966] [2022-04-06 22:55:35,092 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:55:35,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526760577] [2022-04-06 22:55:35,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526760577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:55:35,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:55:35,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-06 22:55:35,093 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:55:35,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309385259] [2022-04-06 22:55:35,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309385259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:55:35,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:55:35,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-06 22:55:35,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137794496] [2022-04-06 22:55:35,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:55:35,094 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 22:55:35,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:55:35,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 22:55:35,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=80, Unknown=3, NotChecked=18, Total=132 [2022-04-06 22:55:35,095 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 22:55:37,416 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0))) is different from false [2022-04-06 22:55:39,621 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) c_main_~a~0))) (let ((.cse16 (+ .cse4 c_main_~x~0))) (let ((.cse5 (div .cse16 c_main_~z~0))) (let ((.cse17 (+ (* .cse5 c_main_~z~0) (* (- 1) .cse5) c_main_~a~0))) (let ((.cse15 (= c_main_~z~0 0)) (.cse8 (= c_main_~az~0 0)) (.cse6 (div .cse17 c_main_~az~0))) (let ((.cse10 (= (mod .cse16 c_main_~z~0) 0)) (.cse7 (= (mod c_main_~y~0 c_main_~z~0) 0)) (.cse9 (= .cse17 0)) (.cse0 (= (* .cse6 c_main_~z~0) c_main_~y~0)) (.cse1 (not .cse8)) (.cse2 (= (mod .cse17 c_main_~az~0) 0)) (.cse11 (not .cse15)) (.cse12 (= c_main_~y~0 0)) (.cse13 (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0))))) (.cse14 (= 0 .cse16))) (and (or (and (or (and .cse0 .cse1 .cse2 (= (* (div (let ((.cse3 (div (+ .cse4 .cse5) c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse6)) (and .cse7 .cse8 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) .cse9)) .cse10 .cse11) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) .cse12 .cse13 .cse14)) (or (and .cse10 (or (and .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2)) .cse11) (and .cse12 .cse13 .cse15 .cse14))))))))) is different from false [2022-04-06 22:55:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:55:39,644 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-06 22:55:39,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-06 22:55:39,646 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-06 22:55:39,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:55:39,647 INFO L225 Difference]: With dead ends: 40 [2022-04-06 22:55:39,647 INFO L226 Difference]: Without dead ends: 33 [2022-04-06 22:55:39,647 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=48, Invalid=115, Unknown=5, NotChecked=72, Total=240 [2022-04-06 22:55:39,648 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-06 22:55:39,648 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 60 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 29 Unchecked, 0.3s Time] [2022-04-06 22:55:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-06 22:55:39,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-06 22:55:39,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 22:55:39,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-04-06 22:55:39,656 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-04-06 22:55:39,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:55:39,657 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-04-06 22:55:39,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 22:55:39,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-06 22:55:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-06 22:55:39,657 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 22:55:39,658 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 22:55:39,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 22:55:39,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:55:39,858 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 22:55:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 22:55:39,859 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 3 times [2022-04-06 22:55:39,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-06 22:55:39,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [193038230] [2022-04-06 22:55:39,864 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-06 22:55:39,864 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-06 22:55:39,864 INFO L85 PathProgramCache]: Analyzing trace with hash -694393736, now seen corresponding path program 4 times [2022-04-06 22:55:39,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 22:55:39,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771516374] [2022-04-06 22:55:39,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 22:55:39,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 22:55:39,873 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 22:55:39,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [112779438] [2022-04-06 22:55:39,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 22:55:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:55:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 22:55:39,875 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 22:55:39,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-06 22:55:40,301 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 22:55:40,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 22:55:40,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-06 22:55:40,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 22:55:40,336 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:40,338 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:40,341 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:44,647 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:44,649 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:44,653 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-06 22:55:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 22:55:45,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 22:55:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 22:55:45,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 22:55:45,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771516374] [2022-04-06 22:55:45,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 22:55:45,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112779438] [2022-04-06 22:55:45,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112779438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 22:55:45,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 22:55:45,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-06 22:55:45,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-06 22:55:45,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [193038230] [2022-04-06 22:55:45,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [193038230] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 22:55:45,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 22:55:45,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-06 22:55:45,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75901550] [2022-04-06 22:55:45,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 22:55:45,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-06 22:55:45,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-06 22:55:45,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-06 22:55:45,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-06 22:55:45,682 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 22:55:47,912 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 22:55:49,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-06 22:55:50,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 22:55:50,316 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-06 22:55:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-06 22:55:50,317 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-06 22:55:50,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 22:55:50,317 INFO L225 Difference]: With dead ends: 33 [2022-04-06 22:55:50,317 INFO L226 Difference]: Without dead ends: 0 [2022-04-06 22:55:50,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-06 22:55:50,318 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 13 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-06 22:55:50,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 67 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2022-04-06 22:55:50,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-06 22:55:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-06 22:55:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-06 22:55:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-06 22:55:50,324 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-06 22:55:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 22:55:50,324 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-06 22:55:50,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 22:55:50,324 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-06 22:55:50,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-06 22:55:50,326 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 22:55:50,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-06 22:55:50,527 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 22:55:50,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-06 22:56:36,694 WARN L232 SmtUtils]: Spent 46.14s on a formula simplification. DAG size of input: 100 DAG size of output: 74 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:57:41,488 WARN L232 SmtUtils]: Spent 1.08m on a formula simplification. DAG size of input: 87 DAG size of output: 71 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 22:59:03,844 WARN L232 SmtUtils]: Spent 1.37m on a formula simplification. DAG size of input: 101 DAG size of output: 81 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 23:00:54,557 WARN L232 SmtUtils]: Spent 1.85m on a formula simplification. DAG size of input: 90 DAG size of output: 75 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 23:02:17,168 WARN L232 SmtUtils]: Spent 1.38m on a formula simplification. DAG size of input: 85 DAG size of output: 67 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-06 23:02:17,191 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-06 23:02:17,192 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse14 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse14 main_~az~0))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (<= |main_#t~post7| 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse13 (* (- 1) main_~a~0))) (let ((.cse6 (+ .cse13 main_~x~0))) (let ((.cse7 (div .cse6 main_~z~0))) (let ((.cse8 (* .cse7 main_~z~0))) (let ((.cse9 (+ (* (- 1) .cse7) main_~a~0 .cse8))) (let ((.cse12 (div .cse9 main_~az~0)) (.cse3 (div (+ .cse7 .cse13) main_~z~0))) (let ((.cse1 (= main_~z~0 0)) (.cse2 (div main_~y~0 main_~z~0)) (.cse10 (= main_~az~0 0)) (.cse4 (* main_~z~0 .cse3)) (.cse11 (= (* .cse12 main_~z~0) main_~y~0)) (.cse5 (= main_~y~0 0))) (and (or .cse1 (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse3) (+ main_~a~0 .cse4))) (or (and .cse1 .cse5 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse6 main_~z~0)) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse7 (+ main_~a~0 .cse8))) (and (= (mod .cse9 main_~az~0) 0) (not .cse10) .cse11)) (not .cse1))) (or (and (= (mod .cse2 main_~z~0) 0) .cse10) (and (= .cse12 (* main_~z~0 (div (+ (* (- 1) .cse3) main_~a~0 .cse4) main_~az~0))) .cse11) .cse5))))))))) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse14 main_~a~0)) .cse0)))) [2022-04-06 23:02:17,192 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse2 (* main_~a~0 main_~z~0))) (let ((.cse0 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse1 (= .cse2 main_~az~0))) (or (and (= main_~z~0 main_~y~0) (<= ~counter~0 1) .cse0 .cse1) (let ((.cse12 (* (- 1) main_~a~0))) (let ((.cse4 (+ .cse12 main_~x~0))) (let ((.cse9 (div .cse4 main_~z~0))) (let ((.cse6 (div (+ .cse9 .cse12) main_~z~0))) (let ((.cse11 (div main_~y~0 main_~z~0)) (.cse7 (* main_~z~0 .cse6)) (.cse3 (= main_~y~0 0))) (and (or (and (= .cse2 0) .cse3 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse4 main_~z~0)) (not (= main_~z~0 0)) (let ((.cse10 (* .cse9 main_~z~0))) (or (let ((.cse8 (+ (* (- 1) .cse9) main_~a~0 .cse10))) (let ((.cse5 (div .cse8 main_~az~0))) (and (= .cse5 (* main_~z~0 (div (+ (* (- 1) .cse6) main_~a~0 .cse7) main_~az~0))) (= (mod .cse8 main_~az~0) 0) (not (= main_~az~0 0)) (= (* .cse5 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod .cse11 main_~z~0) 0) (= .cse9 (+ main_~a~0 .cse10))))))) (or (= (+ (* (div .cse11 main_~z~0) main_~az~0) .cse6) (+ main_~a~0 .cse7)) .cse3))))))) (not (<= |old(~counter~0)| 0)) (and (= main_~y~0 1) (<= ~counter~0 0) .cse0 .cse1)))) [2022-04-06 23:02:17,192 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse15 (* (- 1) main_~a~0))) (let ((.cse5 (+ .cse15 main_~x~0))) (let ((.cse10 (div .cse5 main_~z~0))) (let ((.cse11 (* .cse10 main_~z~0))) (let ((.cse6 (+ (* (- 1) .cse10) main_~a~0 .cse11)) (.cse14 (+ .cse10 .cse15))) (let ((.cse3 (div .cse14 main_~z~0)) (.cse2 (div .cse6 main_~az~0)) (.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 main_~az~0)) (.cse7 (not (= main_~az~0 0))) (.cse8 (= (* .cse2 main_~z~0) main_~y~0)) (.cse9 (not (= main_~z~0 0))) (.cse4 (* main_~z~0 .cse3))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse1 main_~a~0)) .cse0) (and (= .cse2 (* main_~z~0 (div (+ (* (- 1) .cse3) main_~a~0 .cse4) main_~az~0))) (= 0 (mod .cse5 main_~z~0)) (= (mod .cse6 main_~az~0) 0) .cse7 .cse8 .cse9) (let ((.cse12 (= main_~y~0 0))) (and (or (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse10 (+ main_~a~0 .cse11))) (and .cse7 .cse8)) .cse9) .cse12) (or (let ((.cse13 (div main_~y~0 main_~z~0))) (and (= (mod .cse13 main_~z~0) 0) (= (mod .cse14 main_~z~0) 0) (= (+ (* (div .cse13 main_~z~0) main_~az~0) .cse3) (+ main_~a~0 .cse4)))) .cse12) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))))))))))) [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse1 (= .cse0 main_~az~0))) (or (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse0 main_~a~0)) .cse1) (let ((.cse11 (* (- 1) main_~a~0))) (let ((.cse4 (+ .cse11 main_~x~0))) (let ((.cse5 (div .cse4 main_~z~0)) (.cse3 (= main_~y~0 0))) (and (let ((.cse2 (= main_~z~0 0))) (or (and .cse2 .cse3 (= main_~a~0 main_~x~0)) (and (= 0 (mod .cse4 main_~z~0)) (let ((.cse6 (* .cse5 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse6))) (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse6))) (and (= (mod .cse7 main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div .cse7 main_~az~0) main_~z~0) main_~y~0))))) (not .cse2)))) (or (let ((.cse8 (div main_~y~0 main_~z~0)) (.cse9 (+ .cse5 .cse11))) (and (= (mod .cse8 main_~z~0) 0) (= (mod .cse9 main_~z~0) 0) (let ((.cse10 (div .cse9 main_~z~0))) (= (+ (* (div .cse8 main_~z~0) main_~az~0) .cse10) (+ main_~a~0 (* main_~z~0 .cse10)))))) .cse3))))) (and (<= ~counter~0 1) (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse1)))) [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse0 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse1 (= (* main_~a~0 main_~z~0) main_~az~0))) (or (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse0 .cse1) (let ((.cse9 (* (- 1) main_~a~0))) (let ((.cse4 (+ .cse9 main_~x~0))) (let ((.cse5 (= main_~z~0 0)) (.cse2 (div .cse4 main_~z~0))) (and (or (and (let ((.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse2) main_~a~0 .cse3) main_~az~0) main_~z~0) main_~y~0)))) (= 0 (mod .cse4 main_~z~0)) (not .cse5)) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) (or .cse5 (let ((.cse6 (div main_~y~0 main_~z~0)) (.cse7 (+ .cse2 .cse9))) (and (= (mod .cse6 main_~z~0) 0) (= (mod .cse7 main_~z~0) 0) (let ((.cse8 (div .cse7 main_~z~0))) (= (+ (* (div .cse6 main_~z~0) main_~az~0) .cse8) (+ main_~a~0 (* main_~z~0 .cse8))))))))))) (and (<= ~counter~0 1) (= main_~y~0 1) .cse0 .cse1))) [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-06 23:02:17,193 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-06 23:02:17,194 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-06 23:02:17,194 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-06 23:02:17,194 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-06 23:02:17,194 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-06 23:02:17,194 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-06 23:02:17,196 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-04-06 23:02:17,197 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 23:02:17,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 11:02:17 BoogieIcfgContainer [2022-04-06 23:02:17,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 23:02:17,211 INFO L158 Benchmark]: Toolchain (without parser) took 524052.27ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 132.3MB in the beginning and 150.5MB in the end (delta: -18.2MB). Peak memory consumption was 97.8MB. Max. memory is 8.0GB. [2022-04-06 23:02:17,211 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 23:02:17,212 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.08ms. Allocated memory is still 181.4MB. Free memory was 132.2MB in the beginning and 157.0MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 23:02:17,212 INFO L158 Benchmark]: Boogie Preprocessor took 34.97ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-06 23:02:17,212 INFO L158 Benchmark]: RCFGBuilder took 234.32ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 145.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-06 23:02:17,213 INFO L158 Benchmark]: TraceAbstraction took 523563.82ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 145.0MB in the beginning and 150.5MB in the end (delta: -5.5MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. [2022-04-06 23:02:17,214 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.08ms. Allocated memory is still 181.4MB. Free memory was 132.2MB in the beginning and 157.0MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.97ms. Allocated memory is still 181.4MB. Free memory was 157.0MB in the beginning and 155.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 234.32ms. Allocated memory is still 181.4MB. Free memory was 155.5MB in the beginning and 145.5MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 523563.82ms. Allocated memory was 181.4MB in the beginning and 218.1MB in the end (delta: 36.7MB). Free memory was 145.0MB in the beginning and 150.5MB in the end (delta: -5.5MB). Peak memory consumption was 110.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 523.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 386.7s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 52 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 403 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 29 IncrementalHoareTripleChecker+Unchecked, 280 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 171 IncrementalHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 123 mSDtfsCounter, 171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 230 GetRequests, 178 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 51.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 133 NumberOfFragments, 1342 HoareAnnotationTreeSize, 82 FomulaSimplifications, 26 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1437 FormulaSimplificationTreeSizeReductionInter, 386.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: (((((z == y && counter <= 1) && y * az + x == z * x + a) && a * z == az) || ((((a * z == 0 && y == 0) && a == x) || ((0 == (-1 * a + x) % z && !(z == 0)) && (((((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az == z * ((-1 * (((-1 * a + x) / z + -1 * a) / z) + a + z * (((-1 * a + x) / z + -1 * a) / z)) / az) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0) && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y) || ((y % z == 0 && y / z % z == 0) && (-1 * a + x) / z == a + (-1 * a + x) / z * z)))) && (y / z / z * az + ((-1 * a + x) / z + -1 * a) / z == a + z * (((-1 * a + x) / z + -1 * a) / z) || y == 0))) || !(\old(counter) <= 0)) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-06 23:02:17,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...