/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:15:01,143 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:15:01,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:15:01,193 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:15:01,194 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:15:01,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:15:01,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:15:01,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:15:01,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:15:01,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:15:01,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:15:01,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:15:01,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:15:01,210 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:15:01,211 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:15:01,212 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:15:01,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:15:01,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:15:01,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:15:01,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:15:01,217 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:15:01,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:15:01,221 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:15:01,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:15:01,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:15:01,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:15:01,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:15:01,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:15:01,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:15:01,240 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:15:01,241 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:15:01,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:15:01,243 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:15:01,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:15:01,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:15:01,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:15:01,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:15:01,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:15:01,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:15:01,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:15:01,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:15:01,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:15:01,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:15:01,261 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:15:01,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:15:01,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:15:01,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:15:01,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:15:01,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:15:01,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:15:01,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:15:01,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:15:01,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:15:01,266 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:15:01,266 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:15:01,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:15:01,266 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:15:01,266 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:15:01,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:15:01,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:15:01,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:15:01,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:15:01,536 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:15:01,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound2.c [2022-04-08 06:15:01,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fc95d00/8a4d48898b0c41919c0bf419083c6775/FLAG0e22de342 [2022-04-08 06:15:02,010 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:15:02,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound2.c [2022-04-08 06:15:02,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fc95d00/8a4d48898b0c41919c0bf419083c6775/FLAG0e22de342 [2022-04-08 06:15:02,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2fc95d00/8a4d48898b0c41919c0bf419083c6775 [2022-04-08 06:15:02,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:15:02,030 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:15:02,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:15:02,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:15:02,034 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:15:02,035 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,036 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dea93ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02, skipping insertion in model container [2022-04-08 06:15:02,037 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:15:02,054 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:15:02,194 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_unwindbound2.c[525,538] [2022-04-08 06:15:02,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:15:02,220 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:15:02,230 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_unwindbound2.c[525,538] [2022-04-08 06:15:02,236 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:15:02,247 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:15:02,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02 WrapperNode [2022-04-08 06:15:02,248 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:15:02,249 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:15:02,249 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:15:02,249 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:15:02,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,281 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:15:02,288 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:15:02,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:15:02,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:15:02,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (1/1) ... [2022-04-08 06:15:02,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:15:02,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:02,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:15:02,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:15:02,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:15:02,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:15:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:15:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:15:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:15:02,344 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:15:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:15:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:15:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:15:02,345 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:15:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:15:02,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:15:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:15:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:15:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:15:02,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:15:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:15:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:15:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:15:02,348 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:15:02,411 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:15:02,413 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:15:02,599 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:15:02,606 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:15:02,607 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 06:15:02,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:15:02 BoogieIcfgContainer [2022-04-08 06:15:02,608 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:15:02,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:15:02,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:15:02,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:15:02,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:15:02" (1/3) ... [2022-04-08 06:15:02,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:15:02, skipping insertion in model container [2022-04-08 06:15:02,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:15:02" (2/3) ... [2022-04-08 06:15:02,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26fe9fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:15:02, skipping insertion in model container [2022-04-08 06:15:02,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:15:02" (3/3) ... [2022-04-08 06:15:02,615 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound2.c [2022-04-08 06:15:02,619 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:15:02,619 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:15:02,653 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:15:02,658 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:15:02,659 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:15:02,672 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-08 06:15:02,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 06:15:02,678 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:02,679 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:02,679 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:02,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:02,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-08 06:15:02,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:02,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1339060463] [2022-04-08 06:15:02,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:15:02,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-08 06:15:02,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:02,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615887882] [2022-04-08 06:15:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:02,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:02,840 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:02,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389905254] [2022-04-08 06:15:02,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:02,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:02,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:02,844 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:02,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:15:02,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:15:02,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:02,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 06:15:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:02,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:03,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-08 06:15:03,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-08 06:15:03,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-08 06:15:03,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-08 06:15:03,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-08 06:15:03,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {25#true} is VALID [2022-04-08 06:15:03,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-08 06:15:03,013 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-08 06:15:03,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-08 06:15:03,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-08 06:15:03,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-08 06:15:03,015 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-08 06:15:03,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:15:03,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:03,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615887882] [2022-04-08 06:15:03,018 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:03,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389905254] [2022-04-08 06:15:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389905254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:15:03,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:03,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1339060463] [2022-04-08 06:15:03,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1339060463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:03,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:03,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 06:15:03,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111962517] [2022-04-08 06:15:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:03,029 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-08 06:15:03,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:03,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:15:03,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,052 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 06:15:03,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:03,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 06:15:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 06:15:03,086 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-08 06:15:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,164 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-08 06:15:03,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 06:15:03,164 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-08 06:15:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:03,166 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-08 06:15:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-08 06:15:03,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-08 06:15:03,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,249 INFO L225 Difference]: With dead ends: 38 [2022-04-08 06:15:03,249 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 06:15:03,252 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-08 06:15:03,256 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-08 06:15:03,257 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-08 06:15:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 06:15:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 06:15:03,281 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:03,281 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second 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-08 06:15:03,282 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second 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-08 06:15:03,282 INFO L87 Difference]: Start difference. First operand 17 states. Second 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-08 06:15:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,286 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 06:15:03,286 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 06:15:03,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:03,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:03,287 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 17 states. [2022-04-08 06:15:03,287 INFO L87 Difference]: Start difference. First 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) Second operand 17 states. [2022-04-08 06:15:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,289 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-08 06:15:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 06:15:03,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:03,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:03,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:03,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:03,295 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-08 06:15:03,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-08 06:15:03,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-08 06:15:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:03,299 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-08 06:15:03,299 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-08 06:15:03,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-08 06:15:03,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-08 06:15:03,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:15:03,327 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:03,327 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:03,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 06:15:03,528 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-08 06:15:03,529 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:03,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-08 06:15:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:03,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [61430404] [2022-04-08 06:15:03,531 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:15:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-08 06:15:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:03,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329376005] [2022-04-08 06:15:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:03,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:03,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861843991] [2022-04-08 06:15:03,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:03,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:03,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:03,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:03,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:15:03,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:15:03,620 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:03,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 06:15:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:03,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:03,776 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-08 06:15:03,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {211#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:03,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= ~counter~0 0)} assume true; {211#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:03,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#(<= ~counter~0 0)} {203#true} #54#return; {211#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:03,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#(<= ~counter~0 0)} call #t~ret8 := main(); {211#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:03,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {211#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:03,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227#(<= |main_#t~post7| 0)} is VALID [2022-04-08 06:15:03,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(<= |main_#t~post7| 0)} assume !(#t~post7 < 2);havoc #t~post7; {204#false} is VALID [2022-04-08 06:15:03,782 INFO L272 TraceCheckUtils]: 8: Hoare triple {204#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {204#false} is VALID [2022-04-08 06:15:03,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-08 06:15:03,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-08 06:15:03,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-08 06:15:03,783 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-08 06:15:03,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:15:03,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329376005] [2022-04-08 06:15:03,784 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:03,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861843991] [2022-04-08 06:15:03,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861843991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:03,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:03,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:15:03,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:03,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [61430404] [2022-04-08 06:15:03,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [61430404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:03,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:03,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 06:15:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136577892] [2022-04-08 06:15:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:03,788 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-08 06:15:03,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:03,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:15:03,800 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,800 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 06:15:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:03,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 06:15:03,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 06:15:03,801 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-08 06:15:03,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,853 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-08 06:15:03,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 06:15:03,853 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-08 06:15:03,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:03,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 06:15:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-08 06:15:03,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-08 06:15:03,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,896 INFO L225 Difference]: With dead ends: 26 [2022-04-08 06:15:03,896 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 06:15:03,896 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-08 06:15:03,897 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-08 06:15:03,898 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-08 06:15:03,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 06:15:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 06:15:03,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:03,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second 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-08 06:15:03,909 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second 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-08 06:15:03,910 INFO L87 Difference]: Start difference. First operand 19 states. Second 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-08 06:15:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,913 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 06:15:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 06:15:03,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:03,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:03,915 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 19 states. [2022-04-08 06:15:03,915 INFO L87 Difference]: Start difference. First 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) Second operand 19 states. [2022-04-08 06:15:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:03,919 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-08 06:15:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 06:15:03,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:03,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:03,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:03,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:03,920 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-08 06:15:03,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-08 06:15:03,923 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-08 06:15:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:03,924 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-08 06:15:03,924 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-08 06:15:03,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-08 06:15:03,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:03,945 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-08 06:15:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 06:15:03,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:03,946 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:03,964 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-08 06:15:04,151 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-08 06:15:04,152 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:04,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-08 06:15:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:04,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [840801794] [2022-04-08 06:15:04,153 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:15:04,153 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-08 06:15:04,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:04,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346892693] [2022-04-08 06:15:04,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:04,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:04,164 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:04,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1167774947] [2022-04-08 06:15:04,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:04,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:04,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:04,166 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:04,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 06:15:04,213 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:15:04,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:04,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 06:15:04,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:04,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:04,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-08 06:15:04,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {370#true} is VALID [2022-04-08 06:15:04,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-08 06:15:04,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #54#return; {370#true} is VALID [2022-04-08 06:15:04,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret8 := main(); {370#true} is VALID [2022-04-08 06:15:04,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:04,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:04,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 2);havoc #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:04,369 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:15:04,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:15:04,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2022-04-08 06:15:04,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-08 06:15:04,370 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-08 06:15:04,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:15:04,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:04,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346892693] [2022-04-08 06:15:04,371 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:04,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167774947] [2022-04-08 06:15:04,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167774947] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:04,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:04,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:15:04,372 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:04,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [840801794] [2022-04-08 06:15:04,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [840801794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:04,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:04,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:15:04,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76040470] [2022-04-08 06:15:04,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:04,373 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-08 06:15:04,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:04,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:15:04,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:04,384 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:15:04,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:04,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:15:04,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:15:04,385 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-08 06:15:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:04,511 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-08 06:15:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:15:04,512 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-08 06:15:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 06:15:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-08 06:15:04,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-08 06:15:04,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:04,544 INFO L225 Difference]: With dead ends: 28 [2022-04-08 06:15:04,544 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 06:15:04,544 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-08 06:15:04,545 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-08 06:15:04,545 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-08 06:15:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 06:15:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 06:15:04,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:04,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second 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-08 06:15:04,559 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second 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-08 06:15:04,560 INFO L87 Difference]: Start difference. First operand 25 states. Second 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-08 06:15:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:04,561 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 06:15:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:15:04,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:04,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:04,562 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 25 states. [2022-04-08 06:15:04,562 INFO L87 Difference]: Start difference. First 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) Second operand 25 states. [2022-04-08 06:15:04,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:04,564 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-08 06:15:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:15:04,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:04,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:04,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:04,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:04,565 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-08 06:15:04,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-08 06:15:04,566 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-08 06:15:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:04,566 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-08 06:15:04,567 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-08 06:15:04,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-08 06:15:04,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-08 06:15:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 06:15:04,595 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:04,595 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-08 06:15:04,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 06:15:04,807 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-08 06:15:04,808 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:04,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:04,808 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-08 06:15:04,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:04,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298658875] [2022-04-08 06:15:06,119 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:15:06,120 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 06:15:06,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:15:06,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-08 06:15:06,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:06,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649606520] [2022-04-08 06:15:06,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:06,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:06,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:06,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746441804] [2022-04-08 06:15:06,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:06,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:06,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:06,139 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:15:06,142 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-08 06:15:06,184 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:15:06,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:06,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 06:15:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:06,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:06,344 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 06:15:06,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,346 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,346 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 2);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,351 INFO L272 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 1)} ~cond := #in~cond; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 1)} assume !(0 == ~cond); {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= ~counter~0 1)} assume true; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,353 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {592#(<= ~counter~0 1)} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {617#(<= |main_#t~post7| 1)} is VALID [2022-04-08 06:15:06,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {569#false} is VALID [2022-04-08 06:15:06,359 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-08 06:15:06,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 06:15:06,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 06:15:06,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 06:15:06,362 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-08 06:15:06,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:15:06,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-08 06:15:06,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-08 06:15:06,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-08 06:15:06,522 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-08 06:15:06,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {569#false} is VALID [2022-04-08 06:15:06,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {617#(<= |main_#t~post7| 1)} is VALID [2022-04-08 06:15:06,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,524 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {568#true} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-08 06:15:06,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-08 06:15:06,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-08 06:15:06,525 INFO L272 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {568#true} is VALID [2022-04-08 06:15:06,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 2);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-08 06:15:06,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-08 06:15:06,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-08 06:15:06,528 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-08 06:15:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649606520] [2022-04-08 06:15:06,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746441804] [2022-04-08 06:15:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746441804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:15:06,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:15:06,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-08 06:15:06,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:06,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298658875] [2022-04-08 06:15:06,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298658875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:06,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:06,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:15:06,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71443655] [2022-04-08 06:15:06,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:06,531 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-08 06:15:06,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:06,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:15:06,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:06,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:15:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:15:06,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:15:06,557 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-08 06:15:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:06,633 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-08 06:15:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:15:06,633 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-08 06:15:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 06:15:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-08 06:15:06,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-08 06:15:06,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:06,667 INFO L225 Difference]: With dead ends: 34 [2022-04-08 06:15:06,667 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 06:15:06,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:15:06,668 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 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-08 06:15:06,668 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:15:06,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 06:15:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 06:15:06,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:06,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second 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-08 06:15:06,688 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second 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-08 06:15:06,688 INFO L87 Difference]: Start difference. First operand 27 states. Second 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-08 06:15:06,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:06,693 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 06:15:06,693 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 06:15:06,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:06,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:06,699 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 27 states. [2022-04-08 06:15:06,699 INFO L87 Difference]: Start difference. First 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) Second operand 27 states. [2022-04-08 06:15:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:06,705 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-08 06:15:06,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 06:15:06,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:06,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:06,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:06,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:06,706 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-08 06:15:06,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-08 06:15:06,707 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-08 06:15:06,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:06,707 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-08 06:15:06,707 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-08 06:15:06,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-08 06:15:06,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-08 06:15:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 06:15:06,735 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:06,735 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:15:06,754 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-08 06:15:06,943 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-08 06:15:06,943 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:06,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-08 06:15:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:06,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4341274] [2022-04-08 06:15:07,672 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:15:07,672 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 06:15:07,672 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:15:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-08 06:15:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:07,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643205730] [2022-04-08 06:15:07,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:07,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:07,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646309516] [2022-04-08 06:15:07,687 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:15:07,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:07,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:07,694 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-08 06:15:07,695 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-08 06:15:07,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:15:07,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:15:07,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-08 06:15:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:15:07,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:15:08,067 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-08 06:15:08,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {870#true} is VALID [2022-04-08 06:15:08,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-08 06:15:08,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #54#return; {870#true} is VALID [2022-04-08 06:15:08,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret8 := main(); {870#true} is VALID [2022-04-08 06:15:08,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 2);havoc #t~post7; {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,070 INFO L272 TraceCheckUtils]: 8: Hoare triple {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {870#true} is VALID [2022-04-08 06:15:08,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} ~cond := #in~cond; {903#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:15:08,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {903#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:15:08,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:15:08,072 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {907#(not (= |__VERIFIER_assert_#in~cond| 0))} {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {890#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 2);havoc #t~post7; {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-08 06:15:08,135 INFO L272 TraceCheckUtils]: 16: Hoare triple {917#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:15:08,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:15:08,137 INFO L290 TraceCheckUtils]: 18: Hoare triple {931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-08 06:15:08,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-08 06:15:08,137 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-08 06:15:08,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:15:15,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {871#false} assume !false; {871#false} is VALID [2022-04-08 06:15:15,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {931#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {871#false} is VALID [2022-04-08 06:15:15,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {927#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {931#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:15:15,370 INFO L272 TraceCheckUtils]: 16: Hoare triple {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {927#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:15:15,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 2);havoc #t~post7; {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:15:15,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:15:15,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {957#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {947#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:15:15,439 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {907#(not (= |__VERIFIER_assert_#in~cond| 0))} {870#true} #50#return; {957#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-08 06:15:15,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {907#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:15:15,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {907#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:15:15,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {870#true} ~cond := #in~cond; {970#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:15:15,441 INFO L272 TraceCheckUtils]: 8: Hoare triple {870#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {870#true} is VALID [2022-04-08 06:15:15,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {870#true} assume !!(#t~post7 < 2);havoc #t~post7; {870#true} is VALID [2022-04-08 06:15:15,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {870#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {870#true} is VALID [2022-04-08 06:15:15,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {870#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {870#true} is VALID [2022-04-08 06:15:15,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {870#true} call #t~ret8 := main(); {870#true} is VALID [2022-04-08 06:15:15,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {870#true} {870#true} #54#return; {870#true} is VALID [2022-04-08 06:15:15,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {870#true} assume true; {870#true} is VALID [2022-04-08 06:15:15,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {870#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {870#true} is VALID [2022-04-08 06:15:15,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {870#true} call ULTIMATE.init(); {870#true} is VALID [2022-04-08 06:15:15,442 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-08 06:15:15,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:15:15,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643205730] [2022-04-08 06:15:15,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:15:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646309516] [2022-04-08 06:15:15,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646309516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:15:15,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:15:15,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-08 06:15:15,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:15:15,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4341274] [2022-04-08 06:15:15,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4341274] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:15:15,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:15:15,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:15:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163524047] [2022-04-08 06:15:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:15:15,444 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-08 06:15:15,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:15:15,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:15:15,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:15,489 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:15:15,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:15,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:15:15,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 06:15:15,490 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-08 06:15:16,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:16,431 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-08 06:15:16,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 06:15:16,432 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-08 06:15:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:15:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-08 06:15:16,434 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:15:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-08 06:15:16,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-08 06:15:16,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:16,518 INFO L225 Difference]: With dead ends: 36 [2022-04-08 06:15:16,518 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 06:15:16,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 06:15:16,519 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-04-08 06:15:16,519 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.4s Time] [2022-04-08 06:15:16,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 06:15:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-08 06:15:16,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:15:16,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second 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-08 06:15:16,539 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second 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-08 06:15:16,539 INFO L87 Difference]: Start difference. First operand 33 states. Second 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-08 06:15:16,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:16,540 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 06:15:16,540 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 06:15:16,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:16,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:16,541 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 33 states. [2022-04-08 06:15:16,541 INFO L87 Difference]: Start difference. First 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) Second operand 33 states. [2022-04-08 06:15:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:15:16,543 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 06:15:16,543 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 06:15:16,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:15:16,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:15:16,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:15:16,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:15:16,543 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-08 06:15:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-08 06:15:16,545 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-08 06:15:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:15:16,545 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-08 06:15:16,545 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-08 06:15:16,545 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-08 06:15:16,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:15:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-08 06:15:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 06:15:16,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:15:16,625 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-08 06:15:16,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-08 06:15:16,825 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-08 06:15:16,826 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:15:16,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:15:16,826 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-08 06:15:16,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:15:16,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [615011519] [2022-04-08 06:15:19,209 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 06:15:19,210 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-08 06:15:19,210 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 06:15:19,210 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-08 06:15:19,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:15:19,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874426575] [2022-04-08 06:15:19,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:15:19,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:15:19,233 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:15:19,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [256060485] [2022-04-08 06:15:19,234 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 06:15:19,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:15:19,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:15:19,252 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-08 06:15:19,272 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-08 06:16:13,757 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 06:16:13,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:16:13,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 06:16:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-08 06:16:15,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:16:25,101 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:16:32,152 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:16:42,506 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:16:54,670 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-08 06:18:16,674 WARN L232 SmtUtils]: Spent 33.93s on a formula simplification. DAG size of input: 47 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 06:18:27,745 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:18:36,161 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:18:42,197 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:18:48,221 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 06:19:24,914 WARN L232 SmtUtils]: Spent 18.66s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 06:19:52,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2022-04-08 06:19:52,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1208#true} is VALID [2022-04-08 06:19:52,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2022-04-08 06:19:52,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #54#return; {1208#true} is VALID [2022-04-08 06:19:52,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret8 := main(); {1208#true} is VALID [2022-04-08 06:19:52,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {1208#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1208#true} is VALID [2022-04-08 06:19:52,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {1208#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1208#true} is VALID [2022-04-08 06:19:52,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {1208#true} assume !!(#t~post7 < 2);havoc #t~post7; {1208#true} is VALID [2022-04-08 06:19:52,499 INFO L272 TraceCheckUtils]: 8: Hoare triple {1208#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1208#true} is VALID [2022-04-08 06:19:52,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {1208#true} ~cond := #in~cond; {1240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:19:52,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {1240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:19:52,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:19:52,509 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} {1208#true} #50#return; {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:19:54,512 WARN L290 TraceCheckUtils]: 13: Hoare triple {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-08 06:19:54,514 INFO L290 TraceCheckUtils]: 14: Hoare triple {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-08 06:19:54,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} assume !!(#t~post7 < 2);havoc #t~post7; {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-08 06:19:54,517 INFO L272 TraceCheckUtils]: 16: Hoare triple {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1208#true} is VALID [2022-04-08 06:19:54,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {1208#true} ~cond := #in~cond; {1240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:19:54,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:19:54,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:19:54,531 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} {1255#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #50#return; {1277#(and (or (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-08 06:19:56,534 WARN L290 TraceCheckUtils]: 21: Hoare triple {1277#(and (or (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-08 06:19:56,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-08 06:19:56,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} assume !(#t~post7 < 2);havoc #t~post7; {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-08 06:19:56,643 INFO L272 TraceCheckUtils]: 24: Hoare triple {1281#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:19:56,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {1291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:19:56,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {1295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1209#false} is VALID [2022-04-08 06:19:56,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2022-04-08 06:19:56,644 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-08 06:19:56,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:20:12,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {1209#false} assume !false; {1209#false} is VALID [2022-04-08 06:20:12,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {1295#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1209#false} is VALID [2022-04-08 06:20:12,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {1291#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1295#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:20:12,220 INFO L272 TraceCheckUtils]: 24: Hoare triple {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1291#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:20:12,221 INFO L290 TraceCheckUtils]: 23: Hoare triple {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !(#t~post7 < 2);havoc #t~post7; {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:20:12,221 INFO L290 TraceCheckUtils]: 22: Hoare triple {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:20:12,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {1320#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1251#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-08 06:20:12,288 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} {1208#true} #50#return; {1320#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-08 06:20:12,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:20:12,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {1333#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1244#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:20:12,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {1208#true} ~cond := #in~cond; {1333#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:20:12,289 INFO L272 TraceCheckUtils]: 16: Hoare triple {1208#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1208#true} assume !!(#t~post7 < 2);havoc #t~post7; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1208#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {1208#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1208#true} {1208#true} #50#return; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {1208#true} assume true; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {1208#true} assume !(0 == ~cond); {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {1208#true} ~cond := #in~cond; {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L272 TraceCheckUtils]: 8: Hoare triple {1208#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1208#true} is VALID [2022-04-08 06:20:12,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1208#true} assume !!(#t~post7 < 2);havoc #t~post7; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {1208#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {1208#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {1208#true} call #t~ret8 := main(); {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1208#true} {1208#true} #54#return; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {1208#true} assume true; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {1208#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1208#true} is VALID [2022-04-08 06:20:12,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {1208#true} call ULTIMATE.init(); {1208#true} is VALID [2022-04-08 06:20:12,291 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-08 06:20:12,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:20:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874426575] [2022-04-08 06:20:12,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:20:12,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256060485] [2022-04-08 06:20:12,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256060485] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:20:12,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:20:12,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-08 06:20:12,292 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:20:12,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [615011519] [2022-04-08 06:20:12,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [615011519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:20:12,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:20:12,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 06:20:12,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310896883] [2022-04-08 06:20:12,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:20:12,293 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-08 06:20:12,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:20:12,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 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-08 06:20:18,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:20:18,073 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 06:20:18,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:20:18,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 06:20:18,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=81, Unknown=3, NotChecked=18, Total=132 [2022-04-08 06:20:18,074 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-08 06:20:24,440 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-08 06:20:26,443 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-08 06:20:33,183 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-08 06:20:46,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:20:55,079 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-08 06:20:56,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:21:01,194 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-08 06:21:03,205 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:21:05,208 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-08 06:21:07,211 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-08 06:21:09,623 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:21:17,297 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:21:23,548 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-08 06:21:25,551 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-08 06:21:29,559 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-08 06:21:31,562 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-08 06:21:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:31,563 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-08 06:21:31,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 06:21:31,567 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-08 06:21:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:21:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:21:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 06:21:31,569 INFO L82 GeneralOperation]: Start removeUnreachable. 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-08 06:21:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-08 06:21:31,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-08 06:21:37,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 29 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 06:21:37,783 INFO L225 Difference]: With dead ends: 33 [2022-04-08 06:21:37,783 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 06:21:37,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=43, Invalid=114, Unknown=3, NotChecked=22, Total=182 [2022-04-08 06:21:37,784 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 31.9s IncrementalHoareTripleChecker+Time [2022-04-08 06:21:37,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 90 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 12 Unknown, 17 Unchecked, 31.9s Time] [2022-04-08 06:21:37,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 06:21:37,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 06:21:37,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:21:37,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-08 06:21:37,785 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-08 06:21:37,785 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-08 06:21:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:37,785 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:21:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:21:37,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:37,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:37,785 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-08 06:21:37,785 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-08 06:21:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:21:37,785 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:21:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:21:37,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:37,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:21:37,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:21:37,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:21:37,786 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-08 06:21:37,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 06:21:37,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 06:21:37,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:21:37,786 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 06:21:37,786 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-08 06:21:37,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 06:21:37,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:21:37,786 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:21:37,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:21:37,788 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:21:37,795 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-08 06:21:37,989 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-08 06:21:37,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 06:22:02,733 WARN L232 SmtUtils]: Spent 24.71s on a formula simplification. DAG size of input: 82 DAG size of output: 67 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 06:22:32,395 WARN L232 SmtUtils]: Spent 29.65s on a formula simplification. DAG size of input: 81 DAG size of output: 66 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 06:23:06,847 WARN L232 SmtUtils]: Spent 34.43s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 06:23:26,096 WARN L232 SmtUtils]: Spent 19.24s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 06:23:39,410 WARN L232 SmtUtils]: Spent 13.28s on a formula simplification. DAG size of input: 75 DAG size of output: 65 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 06:23:39,438 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-08 06:23:39,439 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 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) (and (= .cse1 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse1 main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse6 main_~x~0))) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse9 (* .cse5 main_~z~0)) (.cse8 (= main_~az~0 0))) (or (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse9))) (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse9)) .cse8)))) (not (= main_~z~0 0)))))))) [2022-04-08 06:23:39,439 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse9 (= .cse0 main_~az~0))) (or (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (let ((.cse5 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse5 main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse4 (div .cse1 main_~z~0))) (let ((.cse8 (* .cse4 main_~z~0)) (.cse7 (= main_~az~0 0))) (or (let ((.cse6 (+ (* (- 1) .cse4) main_~a~0 .cse8))) (let ((.cse2 (div .cse6 main_~az~0))) (and (= .cse2 (* main_~z~0 (div (let ((.cse3 (div (+ .cse4 .cse5) main_~z~0))) (+ (* (- 1) .cse3) main_~a~0 (* main_~z~0 .cse3))) main_~az~0))) (= (mod .cse6 main_~az~0) 0) (not .cse7) (= (* .cse2 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse4 (+ main_~a~0 .cse8)) .cse7)))) (not (= main_~z~0 0))))) (and (= main_~y~0 1) (<= ~counter~0 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse9) (and (= main_~z~0 main_~y~0) (<= ~counter~0 1) (= main_~x~0 (+ .cse0 main_~a~0)) .cse9)))) [2022-04-08 06:23:39,439 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse6 (* (- 1) main_~a~0)) (.cse9 (* main_~a~0 main_~z~0))) (let ((.cse1 (+ .cse9 main_~a~0)) (.cse0 (= .cse9 main_~az~0)) (.cse2 (+ .cse6 main_~x~0))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (and (= main_~a~0 .cse1) (= main_~y~0 0) (= .cse2 0)) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 .cse1) .cse0) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse8 (= main_~az~0 0)) (.cse7 (+ (* (- 1) .cse5) main_~a~0 (* .cse5 main_~z~0)))) (or (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) .cse8 (= 0 .cse7))))) (not (= main_~z~0 0)))))) [2022-04-08 06:23:39,439 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-08 06:23:39,439 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-08 06:23:39,440 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 (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse0 main_~a~0)) .cse1) (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) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse6 main_~x~0))) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse9 (* .cse5 main_~z~0)) (.cse8 (= main_~az~0 0))) (or (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse9))) (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse9)) .cse8)))) (not (= main_~z~0 0)))))))) [2022-04-08 06:23:39,440 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse1 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (.cse2 (= .cse0 main_~az~0))) (or (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) .cse1 .cse2) (and (<= ~counter~0 1) (= main_~y~0 1) .cse1 .cse2) (let ((.cse7 (* (- 1) main_~a~0))) (let ((.cse3 (+ .cse7 main_~x~0))) (and (= 0 (mod .cse3 main_~z~0)) (let ((.cse6 (div .cse3 main_~z~0))) (let ((.cse10 (* .cse6 main_~z~0)) (.cse9 (= main_~az~0 0))) (or (let ((.cse8 (+ (* (- 1) .cse6) main_~a~0 .cse10))) (let ((.cse4 (div .cse8 main_~az~0))) (and (= .cse4 (* main_~z~0 (div (let ((.cse5 (div (+ .cse6 .cse7) main_~z~0))) (+ (* (- 1) .cse5) main_~a~0 (* main_~z~0 .cse5))) main_~az~0))) (= (mod .cse8 main_~az~0) 0) (not .cse9) (= (* .cse4 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse6 (+ main_~a~0 .cse10)) .cse9)))) (not (= main_~z~0 0)))))))) [2022-04-08 06:23:39,440 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 06:23:39,440 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:23:39,440 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-08 06:23:39,440 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-08 06:23:39,441 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-08 06:23:39,441 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-08 06:23:39,441 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:23:39,443 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-08 06:23:39,444 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:23:39,447 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:23:39,449 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 06:23:39,451 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:23:39,452 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:23:39,452 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 06:23:39,458 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 06:23:43,517 INFO L163 areAnnotationChecker]: CFG has 26 edges. 24 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 06:23:43,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:23:43 BoogieIcfgContainer [2022-04-08 06:23:43,537 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:23:43,538 INFO L158 Benchmark]: Toolchain (without parser) took 521508.07ms. Allocated memory was 176.2MB in the beginning and 242.2MB in the end (delta: 66.1MB). Free memory was 123.9MB in the beginning and 123.3MB in the end (delta: 572.8kB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2022-04-08 06:23:43,538 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:23:43,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 216.62ms. Allocated memory was 176.2MB in the beginning and 242.2MB in the end (delta: 66.1MB). Free memory was 123.7MB in the beginning and 215.7MB in the end (delta: -92.0MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. [2022-04-08 06:23:43,539 INFO L158 Benchmark]: Boogie Preprocessor took 38.27ms. Allocated memory is still 242.2MB. Free memory was 215.7MB in the beginning and 214.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 06:23:43,539 INFO L158 Benchmark]: RCFGBuilder took 320.60ms. Allocated memory is still 242.2MB. Free memory was 214.0MB in the beginning and 203.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 06:23:43,539 INFO L158 Benchmark]: TraceAbstraction took 520927.42ms. Allocated memory is still 242.2MB. Free memory was 202.4MB in the beginning and 123.3MB in the end (delta: 79.1MB). Peak memory consumption was 79.7MB. Max. memory is 8.0GB. [2022-04-08 06:23:43,540 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 140.0MB in the end (delta: 76.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 216.62ms. Allocated memory was 176.2MB in the beginning and 242.2MB in the end (delta: 66.1MB). Free memory was 123.7MB in the beginning and 215.7MB in the end (delta: -92.0MB). Peak memory consumption was 12.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.27ms. Allocated memory is still 242.2MB. Free memory was 215.7MB in the beginning and 214.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 320.60ms. Allocated memory is still 242.2MB. Free memory was 214.0MB in the beginning and 203.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 520927.42ms. Allocated memory is still 242.2MB. Free memory was 202.4MB in the beginning and 123.3MB in the end (delta: 79.1MB). Peak memory consumption was 79.7MB. 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: 516.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 81.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 121.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 36 SdHoareTripleChecker+Valid, 32.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 359 SdHoareTripleChecker+Invalid, 32.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 17 IncrementalHoareTripleChecker+Unchecked, 251 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 156 IncrementalHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 108 mSDtfsCounter, 156 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 135 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 68.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 35, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 76 PreInvPairs, 120 NumberOfFragments, 1168 HoareAnnotationTreeSize, 76 FomulaSimplifications, 19 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 638 FormulaSimplificationTreeSizeReductionInter, 121.4s 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: (((((a * z == 0 && y == 0) && a == x) || !(\old(counter) <= 0)) || ((0 == (-1 * a + x) % z && (((((-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) && az == 0))) && !(z == 0))) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az)) || (((z == y && counter <= 1) && x == a * z + 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-08 06:23:43,625 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...