/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-e106359-m
[2022-04-15 07:21:05,284 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-15 07:21:05,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-15 07:21:05,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-15 07:21:05,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-15 07:21:05,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-15 07:21:05,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-15 07:21:05,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-15 07:21:05,335 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-15 07:21:05,336 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-15 07:21:05,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-15 07:21:05,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-15 07:21:05,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-15 07:21:05,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-15 07:21:05,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-15 07:21:05,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-15 07:21:05,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-15 07:21:05,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-15 07:21:05,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-15 07:21:05,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-15 07:21:05,345 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-15 07:21:05,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-15 07:21:05,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-15 07:21:05,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-15 07:21:05,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-15 07:21:05,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-15 07:21:05,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-15 07:21:05,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-15 07:21:05,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-15 07:21:05,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-15 07:21:05,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-15 07:21:05,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-15 07:21:05,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-15 07:21:05,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-15 07:21:05,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-15 07:21:05,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-15 07:21:05,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-15 07:21:05,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-15 07:21:05,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-15 07:21:05,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-15 07:21:05,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-15 07:21:05,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-15 07:21:05,376 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf
[2022-04-15 07:21:05,385 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-15 07:21:05,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-15 07:21:05,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-15 07:21:05,386 INFO L138 SettingsManager]: * sizeof long=4
[2022-04-15 07:21:05,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-15 07:21:05,386 INFO L138 SettingsManager]: * sizeof POINTER=4
[2022-04-15 07:21:05,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * sizeof long double=12
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-15 07:21:05,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-15 07:21:05,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 07:21:05,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-15 07:21:05,388 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-15 07:21:05,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-15 07:21:05,389 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN
[2022-04-15 07:21:05,389 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-15 07:21:05,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-15 07:21:05,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-15 07:21:05,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-15 07:21:05,615 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-15 07:21:05,616 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-15 07:21:05,616 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c
[2022-04-15 07:21:05,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed29919/42d6b9f4c6a94b42a91cd1df2035f236/FLAG4afd737d3
[2022-04-15 07:21:05,999 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-15 07:21:05,999 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c
[2022-04-15 07:21:06,007 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed29919/42d6b9f4c6a94b42a91cd1df2035f236/FLAG4afd737d3
[2022-04-15 07:21:06,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5ed29919/42d6b9f4c6a94b42a91cd1df2035f236
[2022-04-15 07:21:06,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-15 07:21:06,429 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-15 07:21:06,430 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-15 07:21:06,430 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-15 07:21:06,432 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-15 07:21:06,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,434 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d317dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06, skipping insertion in model container
[2022-04-15 07:21:06,434 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-15 07:21:06,453 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-15 07:21:06,619 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/geo3-ll.c[525,538]
[2022-04-15 07:21:06,646 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 07:21:06,653 INFO L203 MainTranslator]: Completed pre-run
[2022-04-15 07:21:06,675 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/geo3-ll.c[525,538]
[2022-04-15 07:21:06,692 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-15 07:21:06,703 INFO L208 MainTranslator]: Completed translation
[2022-04-15 07:21:06,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06 WrapperNode
[2022-04-15 07:21:06,703 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-15 07:21:06,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-15 07:21:06,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-15 07:21:06,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-15 07:21:06,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-15 07:21:06,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-15 07:21:06,743 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-15 07:21:06,743 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-15 07:21:06,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (1/1) ...
[2022-04-15 07:21:06,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-15 07:21:06,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 07:21:06,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-15 07:21:06,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-15 07:21:06,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-15 07:21:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-15 07:21:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-15 07:21:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-15 07:21:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-15 07:21:06,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-15 07:21:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-15 07:21:06,804 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-15 07:21:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-15 07:21:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-15 07:21:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-15 07:21:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-15 07:21:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-15 07:21:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-15 07:21:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-15 07:21:06,858 INFO L234 CfgBuilder]: Building ICFG
[2022-04-15 07:21:06,859 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-15 07:21:06,997 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-15 07:21:07,003 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-15 07:21:07,003 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-15 07:21:07,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:07 BoogieIcfgContainer
[2022-04-15 07:21:07,005 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-15 07:21:07,020 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-15 07:21:07,020 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-15 07:21:07,026 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-15 07:21:07,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:21:06" (1/3) ...
[2022-04-15 07:21:07,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58800121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:07, skipping insertion in model container
[2022-04-15 07:21:07,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:21:06" (2/3) ...
[2022-04-15 07:21:07,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58800121 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:21:07, skipping insertion in model container
[2022-04-15 07:21:07,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:21:07" (3/3) ...
[2022-04-15 07:21:07,028 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll.c
[2022-04-15 07:21:07,032 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-15 07:21:07,032 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-15 07:21:07,075 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-15 07:21:07,080 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-15 07:21:07,081 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-15 07:21:07,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-15 07:21:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-15 07:21:07,103 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 07:21:07,103 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 07:21:07,104 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 07:21:07,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 07:21:07,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times
[2022-04-15 07:21:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:07,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [42312727]
[2022-04-15 07:21:07,124 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 07:21:07,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times
[2022-04-15 07:21:07,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 07:21:07,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081567136]
[2022-04-15 07:21:07,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 07:21:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 07:21:07,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 07:21:07,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752733863]
[2022-04-15 07:21:07,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 07:21:07,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:21:07,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 07:21:07,211 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 07:21:07,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-15 07:21:07,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 07:21:07,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 07:21:07,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core
[2022-04-15 07:21:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 07:21:07,316 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 07:21:07,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID
[2022-04-15 07:21:07,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#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); {24#true} is VALID
[2022-04-15 07:21:07,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID
[2022-04-15 07:21:07,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID
[2022-04-15 07:21:07,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID
[2022-04-15 07:21:07,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#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; {24#true} is VALID
[2022-04-15 07:21:07,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID
[2022-04-15 07:21:07,405 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {25#false} is VALID
[2022-04-15 07:21:07,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID
[2022-04-15 07:21:07,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID
[2022-04-15 07:21:07,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID
[2022-04-15 07:21:07,407 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-15 07:21:07,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 07:21:07,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 07:21:07,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081567136]
[2022-04-15 07:21:07,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 07:21:07,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752733863]
[2022-04-15 07:21:07,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752733863] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:21:07,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:21:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-15 07:21:07,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 07:21:07,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [42312727]
[2022-04-15 07:21:07,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [42312727] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:21:07,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:21:07,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-04-15 07:21:07,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333827539]
[2022-04-15 07:21:07,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 07:21:07,423 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-15 07:21:07,424 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 07:21:07,427 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-15 07:21:07,445 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-15 07:21:07,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2022-04-15 07:21:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:07,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2022-04-15 07:21:07,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-15 07:21:07,474 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-15 07:21:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:07,532 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-15 07:21:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2022-04-15 07:21:07,533 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-15 07:21:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 07:21:07,534 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-15 07:21:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions.
[2022-04-15 07:21:07,539 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-15 07:21:07,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions.
[2022-04-15 07:21:07,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 46 transitions.
[2022-04-15 07:21:07,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:07,598 INFO L225 Difference]: With dead ends: 36
[2022-04-15 07:21:07,598 INFO L226 Difference]: Without dead ends: 16
[2022-04-15 07:21:07,601 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2022-04-15 07:21:07,603 INFO L913 BasicCegarLoop]: 22 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, 22 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-15 07:21:07,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 07:21:07,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2022-04-15 07:21:07,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2022-04-15 07:21:07,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 07:21:07,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-15 07:21:07,628 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-15 07:21:07,628 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-15 07:21:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:07,633 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions.
[2022-04-15 07:21:07,633 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-15 07:21:07,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:07,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:07,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states.
[2022-04-15 07:21:07,634 INFO L87 Difference]: Start difference. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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 16 states.
[2022-04-15 07:21:07,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:07,637 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions.
[2022-04-15 07:21:07,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-15 07:21:07,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:07,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:07,637 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 07:21:07,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 07:21:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 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-15 07:21:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions.
[2022-04-15 07:21:07,640 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11
[2022-04-15 07:21:07,640 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 07:21:07,641 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions.
[2022-04-15 07:21:07,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-15 07:21:07,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions.
[2022-04-15 07:21:07,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-15 07:21:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-15 07:21:07,659 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 07:21:07,659 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 07:21:07,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-15 07:21:07,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2022-04-15 07:21:07,881 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 07:21:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 07:21:07,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times
[2022-04-15 07:21:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:07,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576227111]
[2022-04-15 07:21:07,884 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-15 07:21:07,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times
[2022-04-15 07:21:07,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 07:21:07,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649165395]
[2022-04-15 07:21:07,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 07:21:07,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 07:21:07,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 07:21:07,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1881739390]
[2022-04-15 07:21:07,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 07:21:07,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:21:07,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 07:21:07,904 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-15 07:21:07,936 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-15 07:21:07,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-15 07:21:07,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 07:21:07,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-15 07:21:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 07:21:07,965 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 07:21:08,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID
[2022-04-15 07:21:08,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#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); {194#true} is VALID
[2022-04-15 07:21:08,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID
[2022-04-15 07:21:08,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #53#return; {194#true} is VALID
[2022-04-15 07:21:08,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret7 := main(); {194#true} is VALID
[2022-04-15 07:21:08,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#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; {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID
[2022-04-15 07:21:08,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID
[2022-04-15 07:21:08,122 INFO L272 TraceCheckUtils]: 7: Hoare triple {214#(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)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 07:21:08,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:21:08,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID
[2022-04-15 07:21:08,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#false} assume !false; {195#false} is VALID
[2022-04-15 07:21:08,124 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-15 07:21:08,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-15 07:21:08,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 07:21:08,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649165395]
[2022-04-15 07:21:08,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 07:21:08,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881739390]
[2022-04-15 07:21:08,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881739390] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:21:08,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:21:08,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 07:21:08,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 07:21:08,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576227111]
[2022-04-15 07:21:08,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576227111] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:21:08,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:21:08,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-15 07:21:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029035243]
[2022-04-15 07:21:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 07:21:08,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,127 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 07:21:08,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,139 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-15 07:21:08,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-15 07:21:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:08,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-15 07:21:08,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-15 07:21:08,140 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:08,248 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2022-04-15 07:21:08,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-15 07:21:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 07:21:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions.
[2022-04-15 07:21:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions.
[2022-04-15 07:21:08,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions.
[2022-04-15 07:21:08,278 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-15 07:21:08,281 INFO L225 Difference]: With dead ends: 26
[2022-04-15 07:21:08,281 INFO L226 Difference]: Without dead ends: 23
[2022-04-15 07:21:08,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2022-04-15 07:21:08,287 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 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-15 07:21:08,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-15 07:21:08,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-04-15 07:21:08,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2022-04-15 07:21:08,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 07:21:08,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-15 07:21:08,301 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-15 07:21:08,302 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-15 07:21:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:08,306 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions.
[2022-04-15 07:21:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-15 07:21:08,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:08,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:08,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 23 states.
[2022-04-15 07:21:08,307 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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 23 states.
[2022-04-15 07:21:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:08,309 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions.
[2022-04-15 07:21:08,309 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-15 07:21:08,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:08,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:08,310 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 07:21:08,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 07:21:08,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-15 07:21:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions.
[2022-04-15 07:21:08,312 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11
[2022-04-15 07:21:08,312 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 07:21:08,312 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions.
[2022-04-15 07:21:08,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 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-15 07:21:08,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions.
[2022-04-15 07:21:08,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-15 07:21:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-15 07:21:08,335 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 07:21:08,335 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 07:21:08,360 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-15 07:21:08,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2022-04-15 07:21:08,559 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 07:21:08,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 07:21:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times
[2022-04-15 07:21:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:08,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2074310358]
[2022-04-15 07:21:11,961 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 07:21:11,961 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 07:21:11,961 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 07:21:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 2 times
[2022-04-15 07:21:11,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 07:21:11,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22678620]
[2022-04-15 07:21:11,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 07:21:11,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 07:21:11,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 07:21:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771173332]
[2022-04-15 07:21:11,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-15 07:21:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:21:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 07:21:11,975 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-15 07:21:11,982 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-15 07:21:12,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-15 07:21:12,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 07:21:12,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core
[2022-04-15 07:21:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 07:21:12,145 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 07:21:12,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID
[2022-04-15 07:21:12,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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); {377#true} is VALID
[2022-04-15 07:21:12,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID
[2022-04-15 07:21:12,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #53#return; {377#true} is VALID
[2022-04-15 07:21:12,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret7 := main(); {377#true} is VALID
[2022-04-15 07:21:12,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#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; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID
[2022-04-15 07:21:12,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID
[2022-04-15 07:21:12,420 INFO L272 TraceCheckUtils]: 7: Hoare triple {397#(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)); {377#true} is VALID
[2022-04-15 07:21:12,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#true} ~cond := #in~cond; {407#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:21:12,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:21:12,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:21:12,423 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #49#return; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID
[2022-04-15 07:21:12,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(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; {421#(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-15 07:21:12,425 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(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 !false; {421#(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-15 07:21:12,446 INFO L272 TraceCheckUtils]: 14: Hoare triple {421#(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)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 07:21:12,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:21:12,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID
[2022-04-15 07:21:12,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID
[2022-04-15 07:21:12,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-15 07:21:12,448 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 07:21:41,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID
[2022-04-15 07:21:41,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID
[2022-04-15 07:21:41,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:21:41,964 INFO L272 TraceCheckUtils]: 14: Hoare triple {448#(= (+ (* 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)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 07:21:41,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-15 07:21:41,991 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#(= (+ (* 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; {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-15 07:21:41,996 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} {377#true} #49#return; {455#(= (+ (* 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-15 07:21:41,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:21:41,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:21:41,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#true} ~cond := #in~cond; {468#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 07:21:41,998 INFO L272 TraceCheckUtils]: 7: Hoare triple {377#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {377#true} is VALID
[2022-04-15 07:21:41,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume !false; {377#true} is VALID
[2022-04-15 07:21:41,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#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; {377#true} is VALID
[2022-04-15 07:21:41,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret7 := main(); {377#true} is VALID
[2022-04-15 07:21:41,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #53#return; {377#true} is VALID
[2022-04-15 07:21:41,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID
[2022-04-15 07:21:41,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#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); {377#true} is VALID
[2022-04-15 07:21:41,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID
[2022-04-15 07:21:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-15 07:21:41,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 07:21:42,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22678620]
[2022-04-15 07:21:42,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 07:21:42,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771173332]
[2022-04-15 07:21:42,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771173332] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 07:21:42,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 07:21:42,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11
[2022-04-15 07:21:42,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 07:21:42,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2074310358]
[2022-04-15 07:21:42,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2074310358] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:21:42,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:21:42,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2022-04-15 07:21:42,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224735717]
[2022-04-15 07:21:42,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 07:21:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 18
[2022-04-15 07:21:42,002 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 07:21:42,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-15 07:21:42,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:42,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2022-04-15 07:21:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:42,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2022-04-15 07:21:42,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110
[2022-04-15 07:21:42,033 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-15 07:21:42,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:42,923 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions.
[2022-04-15 07:21:42,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2022-04-15 07:21:42,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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 18
[2022-04-15 07:21:42,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 07:21:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-15 07:21:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions.
[2022-04-15 07:21:42,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-15 07:21:42,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions.
[2022-04-15 07:21:42,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions.
[2022-04-15 07:21:42,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:42,985 INFO L225 Difference]: With dead ends: 33
[2022-04-15 07:21:42,985 INFO L226 Difference]: Without dead ends: 30
[2022-04-15 07:21:42,985 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2022-04-15 07:21:42,986 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2022-04-15 07:21:42,987 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2022-04-15 07:21:42,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2022-04-15 07:21:43,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30.
[2022-04-15 07:21:43,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 07:21:43,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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-15 07:21:43,004 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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-15 07:21:43,004 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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-15 07:21:43,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:43,006 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions.
[2022-04-15 07:21:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2022-04-15 07:21:43,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:43,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:43,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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 30 states.
[2022-04-15 07:21:43,007 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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 30 states.
[2022-04-15 07:21:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:21:43,009 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions.
[2022-04-15 07:21:43,009 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2022-04-15 07:21:43,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:21:43,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:21:43,009 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 07:21:43,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 07:21:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 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-15 07:21:43,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions.
[2022-04-15 07:21:43,011 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18
[2022-04-15 07:21:43,011 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 07:21:43,012 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions.
[2022-04-15 07:21:43,012 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 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-15 07:21:43,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions.
[2022-04-15 07:21:43,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-15 07:21:43,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions.
[2022-04-15 07:21:43,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2022-04-15 07:21:43,059 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-15 07:21:43,059 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-15 07:21:43,093 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-15 07:21:43,259 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:21:43,260 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-15 07:21:43,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-15 07:21:43,260 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 3 times
[2022-04-15 07:21:43,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:21:43,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437281608]
[2022-04-15 07:21:44,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult
[2022-04-15 07:21:44,362 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE
[2022-04-15 07:21:44,362 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-15 07:21:44,362 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 4 times
[2022-04-15 07:21:44,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-15 07:21:44,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177575206]
[2022-04-15 07:21:44,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-15 07:21:44,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-15 07:21:44,373 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-15 07:21:44,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2106826690]
[2022-04-15 07:21:44,374 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2022-04-15 07:21:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:21:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-15 07:21:44,379 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-15 07:21:44,383 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-15 07:21:46,533 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2022-04-15 07:21:46,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-15 07:21:46,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core
[2022-04-15 07:21:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-15 07:21:46,783 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-15 07:22:04,876 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:13,249 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:18,102 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:34,242 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:37,667 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:41,151 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful
[2022-04-15 07:22:46,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID
[2022-04-15 07:22:46,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#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); {685#true} is VALID
[2022-04-15 07:22:46,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID
[2022-04-15 07:22:46,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #53#return; {685#true} is VALID
[2022-04-15 07:22:46,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret7 := main(); {685#true} is VALID
[2022-04-15 07:22:46,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#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; {685#true} is VALID
[2022-04-15 07:22:46,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} assume !false; {685#true} is VALID
[2022-04-15 07:22:46,291 INFO L272 TraceCheckUtils]: 7: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID
[2022-04-15 07:22:46,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} ~cond := #in~cond; {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:22:46,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:22:46,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:22:46,295 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {685#true} #49#return; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-15 07:22:48,297 WARN L290 TraceCheckUtils]: 12: Hoare triple {725#(= (+ (* 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; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is UNKNOWN
[2022-04-15 07:22:48,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !false; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID
[2022-04-15 07:22:48,298 INFO L272 TraceCheckUtils]: 14: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID
[2022-04-15 07:22:48,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#true} ~cond := #in~cond; {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:22:48,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:22:48,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:22:48,300 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #49#return; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID
[2022-04-15 07:22:50,302 WARN L290 TraceCheckUtils]: 19: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~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; {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (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)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is UNKNOWN
[2022-04-15 07:22:50,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (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)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !false; {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (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)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID
[2022-04-15 07:22:50,352 INFO L272 TraceCheckUtils]: 21: Hoare triple {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (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)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 07:22:50,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:22:50,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID
[2022-04-15 07:22:50,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {686#false} assume !false; {686#false} is VALID
[2022-04-15 07:22:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2022-04-15 07:22:50,354 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-15 07:23:19,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {686#false} assume !false; {686#false} is VALID
[2022-04-15 07:23:19,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID
[2022-04-15 07:23:19,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-15 07:23:19,358 INFO L272 TraceCheckUtils]: 21: Hoare triple {725#(= (+ (* 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)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-15 07:23:19,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-15 07:23:19,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#(= (+ (* 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; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID
[2022-04-15 07:23:19,456 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {685#true} #49#return; {784#(= (+ (* 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-15 07:23:19,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:23:19,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID
[2022-04-15 07:23:19,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#true} ~cond := #in~cond; {797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID
[2022-04-15 07:23:19,457 INFO L272 TraceCheckUtils]: 14: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID
[2022-04-15 07:23:19,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !false; {685#true} is VALID
[2022-04-15 07:23:19,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#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; {685#true} is VALID
[2022-04-15 07:23:19,458 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {685#true} {685#true} #49#return; {685#true} is VALID
[2022-04-15 07:23:19,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {685#true} assume true; {685#true} is VALID
[2022-04-15 07:23:19,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID
[2022-04-15 07:23:19,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID
[2022-04-15 07:23:19,458 INFO L272 TraceCheckUtils]: 7: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} assume !false; {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#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; {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret7 := main(); {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #53#return; {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID
[2022-04-15 07:23:19,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#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); {685#true} is VALID
[2022-04-15 07:23:19,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID
[2022-04-15 07:23:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2022-04-15 07:23:19,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-15 07:23:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177575206]
[2022-04-15 07:23:19,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-15 07:23:19,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106826690]
[2022-04-15 07:23:19,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106826690] provided 0 perfect and 2 imperfect interpolant sequences
[2022-04-15 07:23:19,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences.
[2022-04-15 07:23:19,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11
[2022-04-15 07:23:19,461 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-15 07:23:19,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437281608]
[2022-04-15 07:23:19,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437281608] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-15 07:23:19,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-15 07:23:19,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2022-04-15 07:23:19,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356113667]
[2022-04-15 07:23:19,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-15 07:23:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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 25
[2022-04-15 07:23:19,462 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-15 07:23:19,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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-15 07:23:23,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity.
[2022-04-15 07:23:23,593 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2022-04-15 07:23:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-15 07:23:23,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2022-04-15 07:23:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110
[2022-04-15 07:23:23,594 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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-15 07:23:25,681 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-15 07:23:27,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []
[2022-04-15 07:23:29,679 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-15 07:23:32,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:23:32,326 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions.
[2022-04-15 07:23:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2022-04-15 07:23:32,326 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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 25
[2022-04-15 07:23:32,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-15 07:23:32,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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-15 07:23:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions.
[2022-04-15 07:23:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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-15 07:23:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions.
[2022-04-15 07:23:32,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 25 transitions.
[2022-04-15 07:23:40,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 21 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity.
[2022-04-15 07:23:40,560 INFO L225 Difference]: With dead ends: 30
[2022-04-15 07:23:40,560 INFO L226 Difference]: Without dead ends: 0
[2022-04-15 07:23:40,561 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132
[2022-04-15 07:23:40,562 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time
[2022-04-15 07:23:40,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 7.5s Time]
[2022-04-15 07:23:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-15 07:23:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-15 07:23:40,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-15 07:23:40,563 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-15 07:23:40,563 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-15 07:23:40,563 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-15 07:23:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:23:40,564 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-15 07:23:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 07:23:40,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:23:40,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:23:40,564 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-15 07:23:40,564 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-15 07:23:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-15 07:23:40,564 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-15 07:23:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 07:23:40,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:23:40,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-15 07:23:40,565 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-15 07:23:40,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-15 07:23:40,565 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-15 07:23:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-15 07:23:40,565 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25
[2022-04-15 07:23:40,565 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-15 07:23:40,565 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-15 07:23:40,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 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-15 07:23:40,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-15 07:23:40,566 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-15 07:23:40,566 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-15 07:23:40,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-15 07:23:40,568 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-15 07:23:40,578 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-15 07:23:40,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-15 07:23:40,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-15 07:23:43,791 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed.
[2022-04-15 07:23:43,792 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 33 42) the Hoare annotation is: (let ((.cse7 (* main_~a~0 main_~z~0))) (let ((.cse5 (= main_~z~0 0)) (.cse0 (= .cse7 main_~az~0))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and .cse5 (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse7 main_~a~0)) .cse0))))
[2022-04-15 07:23:43,793 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (let ((.cse7 (* main_~a~0 main_~z~0))) (let ((.cse5 (= main_~z~0 0)) (.cse0 (= .cse7 main_~az~0))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and .cse5 (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse7 main_~a~0)) .cse0))))
[2022-04-15 07:23:43,793 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~z~0))) (let ((.cse6 (= main_~z~0 0)) (.cse0 (= main_~a~0 main_~x~0)) (.cse1 (= .cse8 main_~az~0))) (or (and (= main_~y~0 1) .cse0 .cse1) (let ((.cse7 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse7 main_~x~0))) (let ((.cse3 (div main_~y~0 main_~z~0)) (.cse4 (+ (div .cse2 main_~z~0) .cse7))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse2 main_~z~0)) (= (mod .cse3 main_~z~0) 0) (= (mod .cse4 main_~z~0) 0) (let ((.cse5 (div .cse4 main_~z~0))) (= (+ (* (div .cse3 main_~z~0) main_~az~0) .cse5) (+ main_~a~0 (* main_~z~0 .cse5)))) (not .cse6))))) (and .cse6 (= main_~y~0 0) .cse0) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse8 main_~a~0)) .cse1))))
[2022-04-15 07:23:43,793 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 45) the Hoare annotation is: true
[2022-04-15 07:23:43,793 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 45) the Hoare annotation is: true
[2022-04-15 07:23:43,793 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 45) the Hoare annotation is: true
[2022-04-15 07:23:43,793 INFO L885 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: true
[2022-04-15 07:23:43,793 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse7 (* main_~a~0 main_~z~0))) (let ((.cse5 (= main_~z~0 0)) (.cse0 (= .cse7 main_~az~0))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and .cse5 (= main_~y~0 0) (= main_~a~0 main_~x~0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse7 main_~a~0)) .cse0))))
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2022-04-15 07:23:43,794 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-15 07:23:43,794 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|)))
[2022-04-15 07:23:43,794 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true
[2022-04-15 07:23:43,795 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|)))
[2022-04-15 07:23:43,795 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|)))
[2022-04-15 07:23:43,795 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-15 07:23:43,797 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2]
[2022-04-15 07:23:43,798 INFO L177 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-15 07:23:43,801 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-15 07:23:43,801 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-15 07:23:43,802 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-15 07:23:43,803 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-15 07:23:43,803 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-15 07:23:43,808 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation
[2022-04-15 07:23:45,835 INFO L163 areAnnotationChecker]: CFG has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-15 07:23:45,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:23:45 BoogieIcfgContainer
[2022-04-15 07:23:45,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-15 07:23:45,849 INFO L158 Benchmark]: Toolchain (without parser) took 159419.73ms. Allocated memory was 170.9MB in the beginning and 246.4MB in the end (delta: 75.5MB). Free memory was 112.9MB in the beginning and 195.6MB in the end (delta: -82.6MB). Peak memory consumption was 113.6MB. Max. memory is 8.0GB.
[2022-04-15 07:23:45,849 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 170.9MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-15 07:23:45,849 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.02ms. Allocated memory was 170.9MB in the beginning and 246.4MB in the end (delta: 75.5MB). Free memory was 112.7MB in the beginning and 216.6MB in the end (delta: -103.9MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB.
[2022-04-15 07:23:45,849 INFO L158 Benchmark]: Boogie Preprocessor took 38.04ms. Allocated memory is still 246.4MB. Free memory was 216.6MB in the beginning and 215.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-15 07:23:45,850 INFO L158 Benchmark]: RCFGBuilder took 262.30ms. Allocated memory is still 246.4MB. Free memory was 215.1MB in the beginning and 203.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-15 07:23:45,850 INFO L158 Benchmark]: TraceAbstraction took 158827.76ms. Allocated memory is still 246.4MB. Free memory was 203.0MB in the beginning and 195.6MB in the end (delta: 7.5MB). Peak memory consumption was 128.6MB. Max. memory is 8.0GB.
[2022-04-15 07:23:45,851 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.11ms. Allocated memory is still 170.9MB. Free memory is still 128.9MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 274.02ms. Allocated memory was 170.9MB in the beginning and 246.4MB in the end (delta: 75.5MB). Free memory was 112.7MB in the beginning and 216.6MB in the end (delta: -103.9MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 38.04ms. Allocated memory is still 246.4MB. Free memory was 216.6MB in the beginning and 215.1MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 262.30ms. Allocated memory is still 246.4MB. Free memory was 215.1MB in the beginning and 203.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 158827.76ms. Allocated memory is still 246.4MB. Free memory was 203.0MB in the beginning and 195.6MB in the end (delta: 7.5MB). Peak memory consumption was 128.6MB. 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 156.7s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 65 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 22, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 63 PreInvPairs, 100 NumberOfFragments, 544 HoareAnnotationTreeSize, 63 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 278 FormulaSimplificationTreeSizeReductionInter, 3.0s 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: 33]: Loop Invariant
Derived loop invariant: ((((y == 1 && y * az + x == z * x + a) && a * z == az) || (((((y % z == 0 && 0 == (-1 * a + x) % z) && y / z % z == 0) && ((-1 * a + x) / z + -1 * a) % z == 0) && y / z / z * az + ((-1 * a + x) / z + -1 * a) / z == a + z * (((-1 * a + x) / z + -1 * a) / z)) && !(z == 0))) || ((z == 0 && y == 0) && a == x)) || ((z == y && x == a * z + a) && a * z == az)
- ProcedureContractResult [Line: 21]: 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-15 07:23:45,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...