/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo2-ll.c
--------------------------------------------------------------------------------
This is Ultimate 0.2.2-dev-34549b5
[2022-04-08 10:45:35,831 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2022-04-08 10:45:35,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2022-04-08 10:45:35,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-04-08 10:45:35,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-04-08 10:45:35,877 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-04-08 10:45:35,881 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-04-08 10:45:35,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2022-04-08 10:45:35,885 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-04-08 10:45:35,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-04-08 10:45:35,889 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2022-04-08 10:45:35,890 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-04-08 10:45:35,890 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-04-08 10:45:35,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-04-08 10:45:35,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-04-08 10:45:35,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-04-08 10:45:35,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-04-08 10:45:35,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-04-08 10:45:35,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-04-08 10:45:35,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2022-04-08 10:45:35,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values
[2022-04-08 10:45:35,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-04-08 10:45:35,904 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-04-08 10:45:35,905 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2022-04-08 10:45:35,906 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-04-08 10:45:35,909 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-04-08 10:45:35,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-04-08 10:45:35,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-04-08 10:45:35,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-04-08 10:45:35,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-04-08 10:45:35,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-04-08 10:45:35,912 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-04-08 10:45:35,913 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-04-08 10:45:35,914 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-04-08 10:45:35,914 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2022-04-08 10:45:35,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-04-08 10:45:35,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2022-04-08 10:45:35,915 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-04-08 10:45:35,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-04-08 10:45:35,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2022-04-08 10:45:35,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2022-04-08 10:45:35,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2022-04-08 10:45:35,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf
[2022-04-08 10:45:35,929 INFO L113 SettingsManager]: Loading preferences was successful
[2022-04-08 10:45:35,930 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2022-04-08 10:45:35,931 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2022-04-08 10:45:35,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * Use constant arrays=true
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2022-04-08 10:45:35,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * To the following directory=./dump/
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2022-04-08 10:45:35,932 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 10:45:35,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR
[2022-04-08 10:45:35,933 INFO L138 SettingsManager]: * Use separate solver for trace checks=false
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN;
[2022-04-08 10:45:36,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2022-04-08 10:45:36,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-04-08 10:45:36,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-04-08 10:45:36,162 INFO L271 PluginConnector]: Initializing CDTParser...
[2022-04-08 10:45:36,163 INFO L275 PluginConnector]: CDTParser initialized
[2022-04-08 10:45:36,164 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2-ll.c
[2022-04-08 10:45:36,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a251207/ce135f1336164166bdea40f03ba49ba0/FLAG4a8a83284
[2022-04-08 10:45:36,530 INFO L306 CDTParser]: Found 1 translation units.
[2022-04-08 10:45:36,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2-ll.c
[2022-04-08 10:45:36,537 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a251207/ce135f1336164166bdea40f03ba49ba0/FLAG4a8a83284
[2022-04-08 10:45:36,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7a251207/ce135f1336164166bdea40f03ba49ba0
[2022-04-08 10:45:36,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-04-08 10:45:36,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2022-04-08 10:45:36,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-04-08 10:45:36,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-04-08 10:45:36,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2022-04-08 10:45:36,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:45:36" (1/1) ...
[2022-04-08 10:45:36,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b16f525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:36, skipping insertion in model container
[2022-04-08 10:45:36,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:45:36" (1/1) ...
[2022-04-08 10:45:36,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2022-04-08 10:45:36,988 INFO L178 MainTranslator]: Built tables and reachable declarations
[2022-04-08 10:45:37,090 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/geo2-ll.c[525,538]
[2022-04-08 10:45:37,112 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 10:45:37,118 INFO L203 MainTranslator]: Completed pre-run
[2022-04-08 10:45:37,126 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/geo2-ll.c[525,538]
[2022-04-08 10:45:37,130 INFO L210 PostProcessor]: Analyzing one entry point: main
[2022-04-08 10:45:37,140 INFO L208 MainTranslator]: Completed translation
[2022-04-08 10:45:37,140 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37 WrapperNode
[2022-04-08 10:45:37,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-04-08 10:45:37,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-04-08 10:45:37,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2022-04-08 10:45:37,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2022-04-08 10:45:37,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,152 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-04-08 10:45:37,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-04-08 10:45:37,162 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2022-04-08 10:45:37,162 INFO L275 PluginConnector]: RCFGBuilder initialized
[2022-04-08 10:45:37,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (1/1) ...
[2022-04-08 10:45:37,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2022-04-08 10:45:37,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:45:37,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2022-04-08 10:45:37,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2022-04-08 10:45:37,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2022-04-08 10:45:37,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-04-08 10:45:37,228 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error
[2022-04-08 10:45:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2022-04-08 10:45:37,229 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2022-04-08 10:45:37,230 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2022-04-08 10:45:37,230 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2022-04-08 10:45:37,231 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2022-04-08 10:45:37,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2022-04-08 10:45:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2022-04-08 10:45:37,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-04-08 10:45:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2022-04-08 10:45:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2022-04-08 10:45:37,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2022-04-08 10:45:37,280 INFO L234 CfgBuilder]: Building ICFG
[2022-04-08 10:45:37,282 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation
[2022-04-08 10:45:37,445 INFO L275 CfgBuilder]: Performing block encoding
[2022-04-08 10:45:37,450 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-04-08 10:45:37,451 INFO L299 CfgBuilder]: Removed 1 assume(true) statements.
[2022-04-08 10:45:37,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:45:37 BoogieIcfgContainer
[2022-04-08 10:45:37,452 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-04-08 10:45:37,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2022-04-08 10:45:37,453 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2022-04-08 10:45:37,467 INFO L275 PluginConnector]: TraceAbstraction initialized
[2022-04-08 10:45:37,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:45:36" (1/3) ...
[2022-04-08 10:45:37,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15143bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:45:37, skipping insertion in model container
[2022-04-08 10:45:37,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:45:37" (2/3) ...
[2022-04-08 10:45:37,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15143bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:45:37, skipping insertion in model container
[2022-04-08 10:45:37,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:45:37" (3/3) ...
[2022-04-08 10:45:37,469 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll.c
[2022-04-08 10:45:37,472 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION
[2022-04-08 10:45:37,473 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2022-04-08 10:45:37,512 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2022-04-08 10:45:37,518 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP
[2022-04-08 10:45:37,519 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2022-04-08 10:45:37,547 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-08 10:45:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-08 10:45:37,551 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:45:37,552 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:45:37,552 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:45:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:45:37,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times
[2022-04-08 10:45:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:37,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1965903307]
[2022-04-08 10:45:37,575 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 10:45:37,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times
[2022-04-08 10:45:37,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:45:37,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849427459]
[2022-04-08 10:45:37,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:45:37,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:45:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:45:37,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0
[2022-04-08 10:45:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:45:37,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID
[2022-04-08 10:45:37,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID
[2022-04-08 10:45:37,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID
[2022-04-08 10:45:37,764 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID
[2022-04-08 10:45:37,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID
[2022-04-08 10:45:37,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID
[2022-04-08 10:45:37,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID
[2022-04-08 10:45:37,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret6 := main(); {24#true} is VALID
[2022-04-08 10:45:37,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {24#true} is VALID
[2022-04-08 10:45:37,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID
[2022-04-08 10:45:37,767 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {25#false} is VALID
[2022-04-08 10:45:37,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID
[2022-04-08 10:45:37,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID
[2022-04-08 10:45:37,768 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID
[2022-04-08 10:45:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:45:37,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:45:37,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849427459]
[2022-04-08 10:45:37,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849427459] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:45:37,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:45:37,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 10:45:37,775 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:45:37,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1965903307]
[2022-04-08 10:45:37,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1965903307] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:45:37,776 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:45:37,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2022-04-08 10:45:37,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610812138]
[2022-04-08 10:45:37,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:45:37,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-08 10:45:37,782 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:45:37,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:45:37,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:45:37,802 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2022-04-08 10:45:37,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:37,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-04-08 10:45:37,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 10:45:37,826 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:45:37,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:37,929 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions.
[2022-04-08 10:45:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2022-04-08 10:45:37,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11
[2022-04-08 10:45:37,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:45:37,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:45:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions.
[2022-04-08 10:45:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:45:37,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions.
[2022-04-08 10:45:37,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions.
[2022-04-08 10:45:38,007 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-08 10:45:38,014 INFO L225 Difference]: With dead ends: 36
[2022-04-08 10:45:38,014 INFO L226 Difference]: Without dead ends: 16
[2022-04-08 10:45:38,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-04-08 10:45:38,020 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 10:45:38,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 10:45:38,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2022-04-08 10:45:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2022-04-08 10:45:38,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:45:38,047 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-08 10:45:38,047 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-08 10:45:38,047 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-08 10:45:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:38,049 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions.
[2022-04-08 10:45:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-08 10:45:38,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:38,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:38,050 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-08 10:45:38,051 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-08 10:45:38,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:38,052 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions.
[2022-04-08 10:45:38,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-08 10:45:38,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:38,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:38,053 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:45:38,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:45:38,053 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-08 10:45:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions.
[2022-04-08 10:45:38,055 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11
[2022-04-08 10:45:38,055 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:45:38,056 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions.
[2022-04-08 10:45:38,056 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2022-04-08 10:45:38,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions.
[2022-04-08 10:45:38,077 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-08 10:45:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions.
[2022-04-08 10:45:38,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2022-04-08 10:45:38,077 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:45:38,077 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:45:38,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2022-04-08 10:45:38,078 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:45:38,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:45:38,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times
[2022-04-08 10:45:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:38,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [310115791]
[2022-04-08 10:45:38,079 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation
[2022-04-08 10:45:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times
[2022-04-08 10:45:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:45:38,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154932486]
[2022-04-08 10:45:38,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:45:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:45:38,105 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 10:45:38,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394038578]
[2022-04-08 10:45:38,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:45:38,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:45:38,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:45:38,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:45:38,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2022-04-08 10:45:38,161 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2022-04-08 10:45:38,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:45:38,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core
[2022-04-08 10:45:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:45:38,174 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:45:38,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {168#true} call ULTIMATE.init(); {168#true} is VALID
[2022-04-08 10:45:38,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#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); {168#true} is VALID
[2022-04-08 10:45:38,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {168#true} assume true; {168#true} is VALID
[2022-04-08 10:45:38,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {168#true} {168#true} #53#return; {168#true} is VALID
[2022-04-08 10:45:38,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {168#true} call #t~ret6 := main(); {168#true} is VALID
[2022-04-08 10:45:38,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {188#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID
[2022-04-08 10:45:38,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false; {188#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID
[2022-04-08 10:45:38,294 INFO L272 TraceCheckUtils]: 7: Hoare triple {188#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {195#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:45:38,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {195#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {199#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:45:38,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169#false} is VALID
[2022-04-08 10:45:38,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {169#false} assume !false; {169#false} is VALID
[2022-04-08 10:45:38,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:45:38,295 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-04-08 10:45:38,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:45:38,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154932486]
[2022-04-08 10:45:38,296 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 10:45:38,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394038578]
[2022-04-08 10:45:38,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394038578] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:45:38,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:45:38,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 10:45:38,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:45:38,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [310115791]
[2022-04-08 10:45:38,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [310115791] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:45:38,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:45:38,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2022-04-08 10:45:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017535733]
[2022-04-08 10:45:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:45:38,298 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-08 10:45:38,298 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:45:38,298 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-08 10:45:38,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:45:38,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2022-04-08 10:45:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2022-04-08 10:45:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2022-04-08 10:45:38,313 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-08 10:45:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:38,406 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions.
[2022-04-08 10:45:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 10:45:38,407 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-08 10:45:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:45:38,407 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-08 10:45:38,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions.
[2022-04-08 10:45:38,408 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-08 10:45:38,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions.
[2022-04-08 10:45:38,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions.
[2022-04-08 10:45:38,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:45:38,430 INFO L225 Difference]: With dead ends: 26
[2022-04-08 10:45:38,430 INFO L226 Difference]: Without dead ends: 23
[2022-04-08 10:45:38,431 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-08 10:45:38,432 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-08 10:45:38,432 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-08 10:45:38,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states.
[2022-04-08 10:45:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23.
[2022-04-08 10:45:38,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:45:38,440 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-08 10:45:38,440 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-08 10:45:38,441 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-08 10:45:38,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:38,442 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions.
[2022-04-08 10:45:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-08 10:45:38,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:38,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:38,443 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-08 10:45:38,443 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-08 10:45:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:38,444 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions.
[2022-04-08 10:45:38,444 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-08 10:45:38,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:38,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:38,444 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:45:38,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:45:38,445 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-08 10:45:38,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions.
[2022-04-08 10:45:38,446 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11
[2022-04-08 10:45:38,446 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:45:38,446 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions.
[2022-04-08 10:45:38,446 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-08 10:45:38,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions.
[2022-04-08 10:45:38,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:45:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions.
[2022-04-08 10:45:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19
[2022-04-08 10:45:38,468 INFO L491 BasicCegarLoop]: Found error trace
[2022-04-08 10:45:38,468 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2022-04-08 10:45:38,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2022-04-08 10:45:38,685 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:45:38,686 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2022-04-08 10:45:38,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2022-04-08 10:45:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times
[2022-04-08 10:45:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:38,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184762762]
[2022-04-08 10:45:46,062 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays.
[2022-04-08 10:45:46,062 INFO L274 tedInterpolationCore]: Could not compute an accelerate.
[2022-04-08 10:45:46,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 2 times
[2022-04-08 10:45:46,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-04-08 10:45:46,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578558916]
[2022-04-08 10:45:46,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-04-08 10:45:46,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-04-08 10:45:46,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2022-04-08 10:45:46,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77881713]
[2022-04-08 10:45:46,075 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2022-04-08 10:45:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-04-08 10:45:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-04-08 10:45:46,076 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-04-08 10:45:46,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2022-04-08 10:45:46,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2022-04-08 10:45:46,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat
[2022-04-08 10:45:46,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core
[2022-04-08 10:45:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-04-08 10:45:46,126 INFO L286 TraceCheckSpWp]: Computing forward predicates...
[2022-04-08 10:45:46,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID
[2022-04-08 10:45:46,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#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); {351#true} is VALID
[2022-04-08 10:45:46,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID
[2022-04-08 10:45:46,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #53#return; {351#true} is VALID
[2022-04-08 10:45:46,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID
[2022-04-08 10:45:46,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {371#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID
[2022-04-08 10:45:46,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {371#(and (= main_~y~0 1) (= main_~x~0 1))} assume !false; {371#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID
[2022-04-08 10:45:46,303 INFO L272 TraceCheckUtils]: 7: Hoare triple {371#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {351#true} is VALID
[2022-04-08 10:45:46,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#true} ~cond := #in~cond; {351#true} is VALID
[2022-04-08 10:45:46,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~cond); {351#true} is VALID
[2022-04-08 10:45:46,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#true} assume true; {351#true} is VALID
[2022-04-08 10:45:46,305 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {351#true} {371#(and (= main_~y~0 1) (= main_~x~0 1))} #49#return; {371#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID
[2022-04-08 10:45:46,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {371#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {393#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:45:46,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {393#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !false; {393#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID
[2022-04-08 10:45:46,308 INFO L272 TraceCheckUtils]: 14: Hoare triple {393#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:45:46,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:45:46,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {352#false} is VALID
[2022-04-08 10:45:46,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {352#false} assume !false; {352#false} is VALID
[2022-04-08 10:45:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:45:46,310 INFO L328 TraceCheckSpWp]: Computing backward predicates...
[2022-04-08 10:45:46,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {352#false} assume !false; {352#false} is VALID
[2022-04-08 10:45:46,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {352#false} is VALID
[2022-04-08 10:45:46,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2022-04-08 10:45:46,466 INFO L272 TraceCheckUtils]: 14: Hoare triple {420#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2022-04-08 10:45:46,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {420#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !false; {420#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID
[2022-04-08 10:45:46,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {420#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID
[2022-04-08 10:45:46,477 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {351#true} {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} #49#return; {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID
[2022-04-08 10:45:46,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#true} assume true; {351#true} is VALID
[2022-04-08 10:45:46,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#true} assume !(0 == ~cond); {351#true} is VALID
[2022-04-08 10:45:46,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#true} ~cond := #in~cond; {351#true} is VALID
[2022-04-08 10:45:46,478 INFO L272 TraceCheckUtils]: 7: Hoare triple {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {351#true} is VALID
[2022-04-08 10:45:46,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !false; {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID
[2022-04-08 10:45:46,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {351#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {427#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID
[2022-04-08 10:45:46,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret6 := main(); {351#true} is VALID
[2022-04-08 10:45:46,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #53#return; {351#true} is VALID
[2022-04-08 10:45:46,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID
[2022-04-08 10:45:46,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {351#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); {351#true} is VALID
[2022-04-08 10:45:46,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID
[2022-04-08 10:45:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2022-04-08 10:45:46,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-04-08 10:45:46,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578558916]
[2022-04-08 10:45:46,483 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2022-04-08 10:45:46,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77881713]
[2022-04-08 10:45:46,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77881713] provided 1 perfect and 1 imperfect interpolant sequences
[2022-04-08 10:45:46,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-04-08 10:45:46,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8
[2022-04-08 10:45:46,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace
[2022-04-08 10:45:46,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184762762]
[2022-04-08 10:45:46,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184762762] provided 1 perfect and 0 imperfect interpolant sequences
[2022-04-08 10:45:46,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-04-08 10:45:46,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2022-04-08 10:45:46,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229351222]
[2022-04-08 10:45:46,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-04-08 10:45:46,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2022-04-08 10:45:46,485 INFO L84 Accepts]: Finished accepts. word is accepted.
[2022-04-08 10:45:46,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 10:45:46,503 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-08 10:45:46,504 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2022-04-08 10:45:46,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION
[2022-04-08 10:45:46,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2022-04-08 10:45:46,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2022-04-08 10:45:46,505 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 10:45:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:46,587 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions.
[2022-04-08 10:45:46,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2022-04-08 10:45:46,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18
[2022-04-08 10:45:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2022-04-08 10:45:46,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 10:45:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions.
[2022-04-08 10:45:46,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 10:45:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions.
[2022-04-08 10:45:46,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 17 transitions.
[2022-04-08 10:45:46,610 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-08 10:45:46,611 INFO L225 Difference]: With dead ends: 23
[2022-04-08 10:45:46,611 INFO L226 Difference]: Without dead ends: 0
[2022-04-08 10:45:46,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2022-04-08 10:45:46,612 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2022-04-08 10:45:46,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2022-04-08 10:45:46,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2022-04-08 10:45:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2022-04-08 10:45:46,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-04-08 10:45:46,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 10:45:46,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 10:45:46,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 10:45:46,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:46,613 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 10:45:46,613 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 10:45:46,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:46,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:46,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 10:45:46,614 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states.
[2022-04-08 10:45:46,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-04-08 10:45:46,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2022-04-08 10:45:46,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 10:45:46,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:46,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2022-04-08 10:45:46,614 INFO L88 GeneralOperation]: Finished isEquivalent.
[2022-04-08 10:45:46,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-04-08 10:45:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-04-08 10:45:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2022-04-08 10:45:46,615 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18
[2022-04-08 10:45:46,615 INFO L84 Accepts]: Finished accepts. word is rejected.
[2022-04-08 10:45:46,615 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-04-08 10:45:46,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2022-04-08 10:45:46,615 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions.
[2022-04-08 10:45:46,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2022-04-08 10:45:46,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2022-04-08 10:45:46,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2022-04-08 10:45:46,617 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2022-04-08 10:45:46,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2022-04-08 10:45:46,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2
[2022-04-08 10:45:46,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed.
[2022-04-08 10:45:46,910 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed.
[2022-04-08 10:45:46,911 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 33 42) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))
[2022-04-08 10:45:46,912 INFO L878 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))
[2022-04-08 10:45:46,913 INFO L878 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))
[2022-04-08 10:45:46,915 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 23 45) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 23 45) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 23 45) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L878 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true
[2022-04-08 10:45:46,916 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-08 10:45:46,917 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 10:45:46,917 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true
[2022-04-08 10:45:46,919 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 10:45:46,920 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond))
[2022-04-08 10:45:46,920 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|))
[2022-04-08 10:45:46,922 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2]
[2022-04-08 10:45:46,923 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2022-04-08 10:45:46,929 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation
[2022-04-08 10:45:46,931 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2022-04-08 10:45:46,932 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation
[2022-04-08 10:45:46,932 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 10:45:46,932 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation
[2022-04-08 10:45:46,934 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation
[2022-04-08 10:45:46,950 INFO L163 areAnnotationChecker]: CFG has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2022-04-08 10:45:46,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:45:46 BoogieIcfgContainer
[2022-04-08 10:45:46,957 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2022-04-08 10:45:46,958 INFO L158 Benchmark]: Toolchain (without parser) took 9994.34ms. Allocated memory was 220.2MB in the beginning and 278.9MB in the end (delta: 58.7MB). Free memory was 171.7MB in the beginning and 222.8MB in the end (delta: -51.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB.
[2022-04-08 10:45:46,958 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 220.2MB. Free memory is still 187.7MB. There was no memory consumed. Max. memory is 8.0GB.
[2022-04-08 10:45:46,958 INFO L158 Benchmark]: CACSL2BoogieTranslator took 176.12ms. Allocated memory was 220.2MB in the beginning and 278.9MB in the end (delta: 58.7MB). Free memory was 171.4MB in the beginning and 256.7MB in the end (delta: -85.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB.
[2022-04-08 10:45:46,959 INFO L158 Benchmark]: Boogie Preprocessor took 20.30ms. Allocated memory is still 278.9MB. Free memory was 256.7MB in the beginning and 255.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2022-04-08 10:45:46,959 INFO L158 Benchmark]: RCFGBuilder took 290.48ms. Allocated memory is still 278.9MB. Free memory was 255.2MB in the beginning and 243.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2022-04-08 10:45:46,959 INFO L158 Benchmark]: TraceAbstraction took 9503.69ms. Allocated memory is still 278.9MB. Free memory was 243.1MB in the beginning and 222.8MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB.
[2022-04-08 10:45:46,960 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.13ms. Allocated memory is still 220.2MB. Free memory is still 187.7MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 176.12ms. Allocated memory was 220.2MB in the beginning and 278.9MB in the end (delta: 58.7MB). Free memory was 171.4MB in the beginning and 256.7MB in the end (delta: -85.2MB). Peak memory consumption was 13.2MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 20.30ms. Allocated memory is still 278.9MB. Free memory was 256.7MB in the beginning and 255.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
* RCFGBuilder took 290.48ms. Allocated memory is still 278.9MB. Free memory was 255.2MB in the beginning and 243.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
* TraceAbstraction took 9503.69ms. Allocated memory is still 278.9MB. Free memory was 243.1MB in the beginning and 222.8MB in the end (delta: 20.3MB). Peak memory consumption was 20.8MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 17]: call to reach_error is unreachable
For all program executions holds that call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 45 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=2, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 51 PreInvPairs, 76 NumberOfFragments, 94 HoareAnnotationTreeSize, 51 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 77 FormulaSimplificationTreeSizeReductionInter, 0.1s 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: x + z * y == z * x + 1
- ProcedureContractResult [Line: 23]: Procedure Contract for main
Derived contract for procedure main: 1
- ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert
Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond
RESULT: Ultimate proved your program to be correct!
[2022-04-08 10:45:46,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...