/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 12:47:49,848 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 12:47:49,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 12:47:49,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 12:47:49,932 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 12:47:49,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 12:47:49,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 12:47:49,939 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 12:47:49,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 12:47:49,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 12:47:49,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 12:47:49,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 12:47:49,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 12:47:49,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 12:47:49,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 12:47:49,954 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 12:47:49,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 12:47:49,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 12:47:49,958 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 12:47:49,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 12:47:49,965 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 12:47:49,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 12:47:49,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 12:47:49,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 12:47:49,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 12:47:49,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 12:47:49,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 12:47:49,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 12:47:49,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 12:47:49,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 12:47:49,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 12:47:49,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 12:47:49,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 12:47:49,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 12:47:49,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 12:47:49,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 12:47:49,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 12:47:49,983 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 12:47:49,983 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 12:47:49,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 12:47:49,984 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 12:47:49,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 12:47:49,986 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 12:47:49,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 12:47:49,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 12:47:50,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 12:47:50,000 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 12:47:50,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 12:47:50,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 12:47:50,000 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 12:47:50,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 12:47:50,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 12:47:50,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 12:47:50,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 12:47:50,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:47:50,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 12:47:50,002 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 12:47:50,003 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 12:47:50,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 12:47:50,003 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 12:47:50,003 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-28 12:47:50,232 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 12:47:50,260 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 12:47:50,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 12:47:50,263 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 12:47:50,263 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 12:47:50,264 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound100.c [2022-04-28 12:47:50,312 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4121a999f/ad6110866d544398932bb002b4759add/FLAGe8078c23d [2022-04-28 12:47:50,654 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 12:47:50,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound100.c [2022-04-28 12:47:50,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4121a999f/ad6110866d544398932bb002b4759add/FLAGe8078c23d [2022-04-28 12:47:50,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4121a999f/ad6110866d544398932bb002b4759add [2022-04-28 12:47:50,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 12:47:50,672 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 12:47:50,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 12:47:50,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 12:47:50,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 12:47:50,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,678 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3033ba03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50, skipping insertion in model container [2022-04-28 12:47:50,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,683 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 12:47:50,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 12:47:50,824 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_unwindbound100.c[525,538] [2022-04-28 12:47:50,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:47:50,845 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 12:47:50,854 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_unwindbound100.c[525,538] [2022-04-28 12:47:50,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 12:47:50,870 INFO L208 MainTranslator]: Completed translation [2022-04-28 12:47:50,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50 WrapperNode [2022-04-28 12:47:50,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 12:47:50,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 12:47:50,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 12:47:50,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 12:47:50,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 12:47:50,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 12:47:50,897 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 12:47:50,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 12:47:50,900 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (1/1) ... [2022-04-28 12:47:50,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 12:47:50,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:50,932 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-28 12:47:50,949 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-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 12:47:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 12:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 12:47:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 12:47:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 12:47:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 12:47:50,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 12:47:51,031 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 12:47:51,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 12:47:51,185 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 12:47:51,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 12:47:51,192 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 12:47:51,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:47:51 BoogieIcfgContainer [2022-04-28 12:47:51,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 12:47:51,194 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 12:47:51,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 12:47:51,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 12:47:51,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:47:50" (1/3) ... [2022-04-28 12:47:51,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:47:51, skipping insertion in model container [2022-04-28 12:47:51,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:47:50" (2/3) ... [2022-04-28 12:47:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f6535f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:47:51, skipping insertion in model container [2022-04-28 12:47:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:47:51" (3/3) ... [2022-04-28 12:47:51,204 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound100.c [2022-04-28 12:47:51,217 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 12:47:51,217 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 12:47:51,265 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 12:47:51,270 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e1cbd58, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@a36b53d [2022-04-28 12:47:51,270 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 12:47:51,292 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-28 12:47:51,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 12:47:51,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:51,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:51,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 12:47:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626822932] [2022-04-28 12:47:51,327 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:51,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 12:47:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271135142] [2022-04-28 12:47:51,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:51,452 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:51,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640401146] [2022-04-28 12:47:51,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:51,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:51,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:51,459 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-28 12:47:51,483 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-28 12:47:51,546 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:47:51,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:51,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 12:47:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:51,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:51,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-28 12:47:51,632 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-28 12:47:51,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 12:47:51,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 12:47:51,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-28 12:47:51,633 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-28 12:47:51,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 12:47:51,635 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-28 12:47:51,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 12:47:51,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 12:47:51,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 12:47:51,637 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-28 12:47:51,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:47:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:51,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271135142] [2022-04-28 12:47:51,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:51,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640401146] [2022-04-28 12:47:51,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640401146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:51,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:51,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:47:51,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:51,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1626822932] [2022-04-28 12:47:51,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1626822932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:51,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:51,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 12:47:51,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610183103] [2022-04-28 12:47:51,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:51,651 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-28 12:47:51,653 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:51,656 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-28 12:47:51,674 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-28 12:47:51,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 12:47:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:51,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 12:47:51,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 12:47:51,703 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-28 12:47:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:51,773 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-28 12:47:51,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 12:47:51,774 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-28 12:47:51,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:51,776 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-28 12:47:51,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 12:47:51,786 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-28 12:47:51,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-28 12:47:51,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-28 12:47:51,857 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-28 12:47:51,867 INFO L225 Difference]: With dead ends: 38 [2022-04-28 12:47:51,867 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 12:47:51,870 INFO L412 NwaCegarLoop]: 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-28 12:47:51,874 INFO L413 NwaCegarLoop]: 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-28 12:47:51,875 INFO L414 NwaCegarLoop]: 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-28 12:47:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 12:47:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 12:47:51,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:51,910 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-28 12:47:51,911 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-28 12:47:51,911 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-28 12:47:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:51,917 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 12:47:51,918 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:47:51,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:51,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:51,919 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-28 12:47:51,919 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-28 12:47:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:51,922 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 12:47:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:47:51,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:51,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:51,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:51,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:51,925 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-28 12:47:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 12:47:51,936 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 12:47:51,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:51,940 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 12:47:51,940 INFO L496 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-28 12:47:51,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 12:47:51,968 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-28 12:47:51,969 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 12:47:51,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 12:47:51,969 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:51,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:51,998 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-28 12:47:52,195 WARN L477 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-28 12:47:52,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:52,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:52,197 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 12:47:52,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:52,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [572790155] [2022-04-28 12:47:52,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:52,198 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 12:47:52,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:52,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477892595] [2022-04-28 12:47:52,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:52,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:52,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:52,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112686135] [2022-04-28 12:47:52,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:52,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:52,222 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-28 12:47:52,223 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-28 12:47:52,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:47:52,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:52,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 12:47:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:52,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:52,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-28 12:47:52,427 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-28 12:47:52,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= ~counter~0 0)} assume true; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:52,428 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#(<= ~counter~0 0)} {203#true} #54#return; {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:52,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#(<= ~counter~0 0)} call #t~ret8 := main(); {211#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:52,430 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-28 12:47:52,431 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-28 12:47:52,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(<= |main_#t~post7| 0)} assume !(#t~post7 < 100);havoc #t~post7; {204#false} is VALID [2022-04-28 12:47:52,431 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-28 12:47:52,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-28 12:47:52,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-28 12:47:52,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-28 12:47:52,432 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-28 12:47:52,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:47:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477892595] [2022-04-28 12:47:52,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:52,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112686135] [2022-04-28 12:47:52,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112686135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:52,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:47:52,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [572790155] [2022-04-28 12:47:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [572790155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:52,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:52,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 12:47:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115121645] [2022-04-28 12:47:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:52,437 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-28 12:47:52,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:52,438 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-28 12:47:52,460 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-28 12:47:52,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 12:47:52,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:52,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 12:47:52,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 12:47:52,462 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-28 12:47:52,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:52,519 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 12:47:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 12:47:52,519 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-28 12:47:52,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:52,520 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-28 12:47:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 12:47:52,525 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-28 12:47:52,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 12:47:52,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 12:47:52,550 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-28 12:47:52,551 INFO L225 Difference]: With dead ends: 26 [2022-04-28 12:47:52,551 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 12:47:52,552 INFO L412 NwaCegarLoop]: 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-28 12:47:52,553 INFO L413 NwaCegarLoop]: 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-28 12:47:52,553 INFO L414 NwaCegarLoop]: 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-28 12:47:52,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 12:47:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 12:47:52,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:52,561 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-28 12:47:52,561 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-28 12:47:52,561 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-28 12:47:52,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:52,563 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 12:47:52,563 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:47:52,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:52,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:52,564 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-28 12:47:52,564 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-28 12:47:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:52,565 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 12:47:52,566 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:47:52,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:52,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:52,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:52,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:52,567 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-28 12:47:52,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 12:47:52,568 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 12:47:52,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:52,568 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 12:47:52,569 INFO L496 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-28 12:47:52,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 12:47:52,586 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-28 12:47:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 12:47:52,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 12:47:52,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:52,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:52,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 12:47:52,801 WARN L477 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-28 12:47:52,801 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:52,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 12:47:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:52,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277088190] [2022-04-28 12:47:52,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 12:47:52,804 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 12:47:52,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347662840] [2022-04-28 12:47:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:52,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:52,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806649041] [2022-04-28 12:47:52,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:52,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:52,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:52,826 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-28 12:47:52,827 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-28 12:47:52,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 12:47:52,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:52,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 12:47:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:52,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:53,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-28 12:47:53,046 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-28 12:47:53,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-28 12:47:53,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #54#return; {370#true} is VALID [2022-04-28 12:47:53,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret8 := main(); {370#true} is VALID [2022-04-28 12:47:53,048 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-28 12:47:53,049 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-28 12:47:53,049 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 < 100);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-28 12:47:53,050 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-28 12:47:53,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:47:53,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2022-04-28 12:47:53,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-28 12:47:53,052 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-28 12:47:53,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 12:47:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347662840] [2022-04-28 12:47:53,053 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806649041] [2022-04-28 12:47:53,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806649041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:53,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:53,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:47:53,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:53,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277088190] [2022-04-28 12:47:53,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277088190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:53,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:53,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:47:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516647288] [2022-04-28 12:47:53,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:53,055 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-28 12:47:53,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:53,056 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-28 12:47:53,067 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-28 12:47:53,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:47:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:53,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:47:53,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 12:47:53,069 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-28 12:47:53,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:53,178 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 12:47:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 12:47:53,178 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-28 12:47:53,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:53,179 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-28 12:47:53,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 12:47:53,181 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-28 12:47:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 12:47:53,182 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 12:47:53,209 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-28 12:47:53,210 INFO L225 Difference]: With dead ends: 28 [2022-04-28 12:47:53,211 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 12:47:53,211 INFO L412 NwaCegarLoop]: 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-28 12:47:53,212 INFO L413 NwaCegarLoop]: 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-28 12:47:53,213 INFO L414 NwaCegarLoop]: 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-28 12:47:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 12:47:53,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 12:47:53,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:53,225 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-28 12:47:53,225 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-28 12:47:53,225 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-28 12:47:53,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:53,227 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 12:47:53,227 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:47:53,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:53,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:53,228 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-28 12:47:53,228 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-28 12:47:53,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:53,230 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 12:47:53,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:47:53,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:53,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:53,230 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:53,230 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:53,231 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-28 12:47:53,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 12:47:53,232 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 12:47:53,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:53,232 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 12:47:53,233 INFO L496 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-28 12:47:53,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 12:47:53,257 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-28 12:47:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 12:47:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:47:53,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:53,258 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:53,286 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-28 12:47:53,483 WARN L477 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-28 12:47:53,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:53,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:53,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 12:47:53,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:53,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [205306677] [2022-04-28 12:47:57,621 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:47:57,621 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:47:57,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 12:47:57,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:57,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040225378] [2022-04-28 12:47:57,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:57,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:57,648 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:57,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101881760] [2022-04-28 12:47:57,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:57,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:57,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:57,657 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-28 12:47:57,745 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-28 12:47:57,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:47:57,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:57,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 12:47:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:57,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:47:57,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 12:47:57,923 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-28 12:47:57,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:57,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:57,925 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-28 12:47:57,926 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-28 12:47:57,927 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-28 12:47:57,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:57,929 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-28 12:47:57,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 1)} ~cond := #in~cond; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:57,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 1)} assume !(0 == ~cond); {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:57,930 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= ~counter~0 1)} assume true; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:57,931 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {592#(<= ~counter~0 1)} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-28 12:47:57,935 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-28 12:47:57,935 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-28 12:47:57,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {569#false} is VALID [2022-04-28 12:47:57,937 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-28 12:47:57,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 12:47:57,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 12:47:57,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 12:47:57,939 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-28 12:47:57,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:47:58,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-28 12:47:58,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-28 12:47:58,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-28 12:47:58,112 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-28 12:47:58,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {645#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {569#false} is VALID [2022-04-28 12:47:58,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {645#(< |main_#t~post7| 100)} is VALID [2022-04-28 12:47:58,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#(< ~counter~0 100)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {649#(< ~counter~0 100)} is VALID [2022-04-28 12:47:58,114 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {568#true} {649#(< ~counter~0 100)} #50#return; {649#(< ~counter~0 100)} is VALID [2022-04-28 12:47:58,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-28 12:47:58,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-28 12:47:58,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-28 12:47:58,115 INFO L272 TraceCheckUtils]: 8: Hoare triple {649#(< ~counter~0 100)} 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-28 12:47:58,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {649#(< ~counter~0 100)} is VALID [2022-04-28 12:47:58,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {649#(< ~counter~0 100)} is VALID [2022-04-28 12:47:58,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(< ~counter~0 99)} 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; {674#(< ~counter~0 99)} is VALID [2022-04-28 12:47:58,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#(< ~counter~0 99)} call #t~ret8 := main(); {674#(< ~counter~0 99)} is VALID [2022-04-28 12:47:58,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#(< ~counter~0 99)} {568#true} #54#return; {674#(< ~counter~0 99)} is VALID [2022-04-28 12:47:58,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#(< ~counter~0 99)} assume true; {674#(< ~counter~0 99)} is VALID [2022-04-28 12:47:58,119 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; {674#(< ~counter~0 99)} is VALID [2022-04-28 12:47:58,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-28 12:47:58,120 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-28 12:47:58,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:47:58,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040225378] [2022-04-28 12:47:58,121 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:47:58,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101881760] [2022-04-28 12:47:58,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101881760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:47:58,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:47:58,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 12:47:58,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:47:58,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [205306677] [2022-04-28 12:47:58,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [205306677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:47:58,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:47:58,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 12:47:58,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862256929] [2022-04-28 12:47:58,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:47:58,124 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-28 12:47:58,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:47:58,124 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-28 12:47:58,141 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-28 12:47:58,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 12:47:58,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 12:47:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 12:47:58,142 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-28 12:47:58,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:58,212 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 12:47:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 12:47:58,212 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-28 12:47:58,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:47:58,213 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-28 12:47:58,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 12:47:58,215 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-28 12:47:58,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 12:47:58,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 12:47:58,243 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-28 12:47:58,245 INFO L225 Difference]: With dead ends: 34 [2022-04-28 12:47:58,245 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 12:47:58,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 12:47:58,247 INFO L413 NwaCegarLoop]: 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-28 12:47:58,248 INFO L414 NwaCegarLoop]: 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-28 12:47:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 12:47:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 12:47:58,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:47:58,268 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-28 12:47:58,269 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-28 12:47:58,270 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-28 12:47:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:58,274 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 12:47:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:47:58,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:58,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:58,279 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-28 12:47:58,279 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-28 12:47:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:47:58,283 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 12:47:58,283 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:47:58,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:47:58,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:47:58,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:47:58,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:47:58,285 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-28 12:47:58,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 12:47:58,288 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 12:47:58,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:47:58,288 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 12:47:58,288 INFO L496 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-28 12:47:58,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 12:47:58,316 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-28 12:47:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 12:47:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 12:47:58,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:47:58,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:47:58,342 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-28 12:47:58,539 WARN L477 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-28 12:47:58,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:47:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:47:58,540 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 12:47:58,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:47:58,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [660489716] [2022-04-28 12:47:59,676 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:47:59,677 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:47:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 12:47:59,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:47:59,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275283569] [2022-04-28 12:47:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:47:59,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:47:59,696 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:47:59,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [284795589] [2022-04-28 12:47:59,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 12:47:59,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:47:59,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:47:59,704 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-28 12:47:59,724 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-28 12:47:59,748 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 12:47:59,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:47:59,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 12:47:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:47:59,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:00,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 12:48:00,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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; {873#true} is VALID [2022-04-28 12:48:00,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 12:48:00,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 12:48:00,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 12:48:00,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#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; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:00,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#(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; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:00,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 100);havoc #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:00,034 INFO L272 TraceCheckUtils]: 8: Hoare triple {893#(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)); {873#true} is VALID [2022-04-28 12:48:00,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:00,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:00,035 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:00,036 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 12:48:00,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(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; {920#(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-28 12:48:00,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(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; {920#(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-28 12:48:00,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(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 < 100);havoc #t~post7; {920#(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-28 12:48:00,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(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)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:48:00,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:00,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 12:48:00,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 12:48:00,103 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-28 12:48:00,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:48:09,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-28 12:48:09,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-28 12:48:09,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:48:09,204 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* 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)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:48:09,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 100);havoc #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:48:09,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* 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; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:48:09,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(= (+ (* 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; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:48:09,242 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {873#true} #50#return; {960#(= (+ (* 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-28 12:48:09,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:09,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:48:09,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:48:09,244 INFO L272 TraceCheckUtils]: 8: Hoare triple {873#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-28 12:48:09,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} assume !!(#t~post7 < 100);havoc #t~post7; {873#true} is VALID [2022-04-28 12:48:09,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {873#true} is VALID [2022-04-28 12:48:09,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#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; {873#true} is VALID [2022-04-28 12:48:09,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-28 12:48:09,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-28 12:48:09,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-28 12:48:09,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#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; {873#true} is VALID [2022-04-28 12:48:09,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-28 12:48:09,245 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-28 12:48:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:48:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275283569] [2022-04-28 12:48:09,246 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:48:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284795589] [2022-04-28 12:48:09,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284795589] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:48:09,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:48:09,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 12:48:09,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:48:09,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [660489716] [2022-04-28 12:48:09,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [660489716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:48:09,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:48:09,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 12:48:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525531748] [2022-04-28 12:48:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:48:09,248 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-28 12:48:09,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:48:09,248 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-28 12:48:09,294 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-28 12:48:09,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 12:48:09,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:09,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 12:48:09,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 12:48:09,295 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-28 12:48:10,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:10,093 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 12:48:10,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 12:48:10,093 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-28 12:48:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:48:10,094 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-28 12:48:10,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 12:48:10,096 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-28 12:48:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 12:48:10,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-28 12:48:10,165 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-28 12:48:10,166 INFO L225 Difference]: With dead ends: 36 [2022-04-28 12:48:10,166 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 12:48:10,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 12:48:10,167 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 12:48:10,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 12:48:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 12:48:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 12:48:10,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:48:10,187 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-28 12:48:10,187 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-28 12:48:10,188 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-28 12:48:10,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:10,189 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 12:48:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:48:10,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:10,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:10,190 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-28 12:48:10,190 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-28 12:48:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:48:10,191 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 12:48:10,192 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:48:10,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:48:10,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:48:10,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:48:10,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:48:10,192 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-28 12:48:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 12:48:10,193 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-28 12:48:10,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:48:10,194 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 12:48:10,194 INFO L496 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-28 12:48:10,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 12:48:10,246 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-28 12:48:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 12:48:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 12:48:10,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 12:48:10,246 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 12:48:10,263 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-28 12:48:10,455 WARN L477 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-28 12:48:10,456 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 12:48:10,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 12:48:10,456 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-28 12:48:10,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 12:48:10,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2038337045] [2022-04-28 12:48:13,760 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 12:48:13,760 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 12:48:13,760 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-28 12:48:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 12:48:13,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943640300] [2022-04-28 12:48:13,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 12:48:13,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 12:48:13,773 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 12:48:13,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1031928984] [2022-04-28 12:48:13,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 12:48:13,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 12:48:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 12:48:13,776 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-28 12:48:13,807 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-28 12:48:14,213 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 12:48:14,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 12:48:14,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 12:48:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 12:48:14,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 12:48:22,701 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:48:30,948 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:48:41,574 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:48:53,414 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-28 12:50:31,277 WARN L232 SmtUtils]: Spent 46.54s 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-28 12:50:42,602 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:50:52,623 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:50:56,922 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:51:01,878 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 12:51:12,802 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) c_main_~a~0))) (let ((.cse6 (+ .cse4 c_main_~x~0))) (or (and (let ((.cse5 (div .cse6 c_main_~z~0))) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (+ (* .cse5 c_main_~z~0) (* (- 1) .cse5) c_main_~a~0))) (or (let ((.cse0 (div .cse2 c_main_~az~0))) (and (= (* .cse0 c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0) (= (* (div (let ((.cse3 (div (+ .cse4 .cse5) c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse0))) (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) (= .cse2 0))))) (= (mod .cse6 c_main_~z~0) 0) (not (= c_main_~z~0 0))) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) (= c_main_~y~0 0) (= 0 .cse6))))) is different from false [2022-04-28 12:51:29,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 12:51:29,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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; {1211#true} is VALID [2022-04-28 12:51:29,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:51:29,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 12:51:29,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 12:51:29,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#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; {1211#true} is VALID [2022-04-28 12:51:29,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:51:29,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 100);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:51:29,891 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:51:29,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:51:29,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:29,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:29,901 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:51:31,903 WARN L290 TraceCheckUtils]: 13: Hoare triple {1254#(= (+ (* 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; {1258#(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-28 12:51:31,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(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; {1258#(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-28 12:51:31,915 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(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 < 100);havoc #t~post7; {1258#(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-28 12:51:31,915 INFO L272 TraceCheckUtils]: 16: Hoare triple {1258#(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)); {1211#true} is VALID [2022-04-28 12:51:31,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:51:31,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:31,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:31,919 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1258#(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; {1280#(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-28 12:51:33,923 WARN L290 TraceCheckUtils]: 21: Hoare triple {1280#(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; {1284#(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-28 12:51:33,925 INFO L290 TraceCheckUtils]: 22: Hoare triple {1284#(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; {1284#(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-28 12:51:33,927 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#(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 < 100);havoc #t~post7; {1284#(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-28 12:51:34,047 INFO L272 TraceCheckUtils]: 24: Hoare triple {1284#(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)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:51:34,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:51:34,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 12:51:34,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 12:51:34,049 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-28 12:51:34,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 12:51:45,561 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-28 12:51:45,561 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-28 12:51:45,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 12:51:45,562 INFO L272 TraceCheckUtils]: 24: Hoare triple {1254#(= (+ (* 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)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 12:51:45,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !(#t~post7 < 100);havoc #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:51:45,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#(= (+ (* 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; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:51:45,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* 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; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 12:51:45,595 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1323#(= (+ (* 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-28 12:51:45,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:45,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 12:51:45,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 12:51:45,596 INFO L272 TraceCheckUtils]: 16: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:51:45,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !!(#t~post7 < 100);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:51:45,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:51:45,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#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; {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1211#true} #50#return; {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-28 12:51:45,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 100);havoc #t~post7; {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#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; {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-28 12:51:45,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#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; {1211#true} is VALID [2022-04-28 12:51:45,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-28 12:51:45,599 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-28 12:51:45,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 12:51:45,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943640300] [2022-04-28 12:51:45,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 12:51:45,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031928984] [2022-04-28 12:51:45,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031928984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 12:51:45,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 12:51:45,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-28 12:51:45,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 12:51:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2038337045] [2022-04-28 12:51:45,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2038337045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 12:51:45,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 12:51:45,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 12:51:45,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068840934] [2022-04-28 12:51:45,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 12:51:45,601 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-28 12:51:45,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 12:51:45,602 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-28 12:51:51,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 22 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-28 12:51:51,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 12:51:51,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 12:51:51,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 12:51:51,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=66, Unknown=4, NotChecked=34, Total=132 [2022-04-28 12:51:51,640 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-28 12:51:57,867 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-28 12:52:51,144 WARN L232 SmtUtils]: Spent 52.05s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 12:53:22,739 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-28 12:53:24,802 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-28 12:53:26,804 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-28 12:53:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:26,830 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 12:53:26,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 12:53:26,830 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-28 12:53:26,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 12:53:26,831 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-28 12:53:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 12:53:26,832 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-28 12:53:26,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 32 transitions. [2022-04-28 12:53:26,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 32 transitions. [2022-04-28 12:53:31,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 12:53:31,109 INFO L225 Difference]: With dead ends: 34 [2022-04-28 12:53:31,109 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 12:53:31,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 116.9s TimeCoverageRelationStatistics Valid=46, Invalid=114, Unknown=4, NotChecked=46, Total=210 [2022-04-28 12:53:31,110 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-28 12:53:31,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 90 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 4 Unknown, 30 Unchecked, 8.3s Time] [2022-04-28 12:53:31,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 12:53:31,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 12:53:31,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 12:53:31,111 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-28 12:53:31,111 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-28 12:53:31,111 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-28 12:53:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:31,112 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:53:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:53:31,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:53:31,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:53:31,112 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-28 12:53:31,112 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-28 12:53:31,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 12:53:31,112 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 12:53:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:53:31,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:53:31,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 12:53:31,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 12:53:31,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 12:53:31,113 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-28 12:53:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 12:53:31,113 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 12:53:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 12:53:31,113 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 12:53:31,113 INFO L496 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-28 12:53:31,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 12:53:31,114 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-28 12:53:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 12:53:31,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 12:53:31,117 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 12:53:31,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-28 12:53:31,323 WARN L477 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-28 12:53:31,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 12:53:46,634 WARN L232 SmtUtils]: Spent 15.27s on a formula simplification. DAG size of input: 84 DAG size of output: 68 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:54:26,387 WARN L232 SmtUtils]: Spent 39.74s on a formula simplification. DAG size of input: 73 DAG size of output: 51 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:54:59,349 WARN L232 SmtUtils]: Spent 32.95s 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-28 12:55:34,827 WARN L232 SmtUtils]: Spent 35.47s on a formula simplification. DAG size of input: 72 DAG size of output: 49 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:56:13,033 WARN L232 SmtUtils]: Spent 38.16s on a formula simplification. DAG size of input: 55 DAG size of output: 51 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 12:56:13,059 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 12:56:13,060 INFO L895 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-28 12:56:13,060 INFO L895 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-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~z~0)) (.cse0 (= main_~a~0 main_~x~0))) (or (and (= main_~y~0 1) .cse0 (= .cse1 main_~az~0)) (and (= .cse1 0) (= main_~y~0 0) .cse0) (not (<= |old(~counter~0)| 0)) (let ((.cse4 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse2 (div .cse4 main_~z~0))) (let ((.cse3 (* .cse2 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse2 (+ main_~a~0 .cse3))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse2) main_~a~0 .cse3) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse4 main_~z~0)) (not (= main_~z~0 0)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))))) [2022-04-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-28 12:56:13,061 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-28 12:56:13,061 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-28 12:56:13,061 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse3 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))) (or (and (or (let ((.cse2 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse0 (div .cse2 main_~z~0))) (let ((.cse1 (* .cse0 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse0 (+ main_~a~0 .cse1))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse0) main_~a~0 .cse1) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) .cse3) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) (= main_~y~0 1) .cse3 (= (* main_~a~0 main_~z~0) main_~az~0)))) [2022-04-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse3 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))) (or (and (or (let ((.cse2 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse0 (div .cse2 main_~z~0))) (let ((.cse1 (* .cse0 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse0 (+ main_~a~0 .cse1))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse0) main_~a~0 .cse1) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) .cse3) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) (= main_~y~0 1) .cse3 (= (* main_~a~0 main_~z~0) main_~az~0)))) [2022-04-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:56:13,061 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 12:56:13,061 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:56:13,061 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 12:56:13,062 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 12:56:13,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 12:56:13,062 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 12:56:13,062 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:56:13,062 INFO L895 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-28 12:56:13,062 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 12:56:13,062 INFO L895 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-28 12:56:13,062 INFO L895 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-28 12:56:13,062 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 12:56:13,065 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-28 12:56:13,067 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 12:56:13,069 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 12:56:13,072 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 12:56:13,074 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 12:56:13,075 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:56:13,075 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 12:56:13,081 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 12:56:17,225 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-28 12:56:17,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:56:17 BoogieIcfgContainer [2022-04-28 12:56:17,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 12:56:17,242 INFO L158 Benchmark]: Toolchain (without parser) took 506570.00ms. Allocated memory was 198.2MB in the beginning and 260.0MB in the end (delta: 61.9MB). Free memory was 148.5MB in the beginning and 162.1MB in the end (delta: -13.6MB). Peak memory consumption was 47.7MB. Max. memory is 8.0GB. [2022-04-28 12:56:17,242 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 198.2MB. Free memory was 164.8MB in the beginning and 164.7MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 12:56:17,242 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.74ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 173.2MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 12:56:17,243 INFO L158 Benchmark]: Boogie Preprocessor took 24.61ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 172.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 12:56:17,243 INFO L158 Benchmark]: RCFGBuilder took 296.82ms. Allocated memory is still 198.2MB. Free memory was 171.6MB in the beginning and 161.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 12:56:17,243 INFO L158 Benchmark]: TraceAbstraction took 506044.93ms. Allocated memory was 198.2MB in the beginning and 260.0MB in the end (delta: 61.9MB). Free memory was 160.6MB in the beginning and 162.1MB in the end (delta: -1.5MB). Peak memory consumption was 60.9MB. Max. memory is 8.0GB. [2022-04-28 12:56:17,244 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.15ms. Allocated memory is still 198.2MB. Free memory was 164.8MB in the beginning and 164.7MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 197.74ms. Allocated memory is still 198.2MB. Free memory was 148.4MB in the beginning and 173.2MB in the end (delta: -24.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.61ms. Allocated memory is still 198.2MB. Free memory was 173.2MB in the beginning and 172.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 296.82ms. Allocated memory is still 198.2MB. Free memory was 171.6MB in the beginning and 161.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 506044.93ms. Allocated memory was 198.2MB in the beginning and 260.0MB in the end (delta: 61.9MB). Free memory was 160.6MB in the beginning and 162.1MB in the end (delta: -1.5MB). Peak memory consumption was 60.9MB. 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: 501.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 100.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 161.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 346 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 238 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 108 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 117.2s 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, 82 PreInvPairs, 133 NumberOfFragments, 855 HoareAnnotationTreeSize, 82 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 836 FormulaSimplificationTreeSizeReductionInter, 161.7s 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-28 12:56:17,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...