/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 06:10:49,475 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 06:10:49,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 06:10:49,534 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 06:10:49,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 06:10:49,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 06:10:49,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 06:10:49,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 06:10:49,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 06:10:49,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 06:10:49,546 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 06:10:49,547 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 06:10:49,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 06:10:49,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 06:10:49,548 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 06:10:49,549 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 06:10:49,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 06:10:49,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 06:10:49,551 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 06:10:49,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 06:10:49,553 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 06:10:49,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 06:10:49,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 06:10:49,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 06:10:49,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 06:10:49,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 06:10:49,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 06:10:49,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 06:10:49,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 06:10:49,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 06:10:49,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 06:10:49,560 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 06:10:49,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 06:10:49,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 06:10:49,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 06:10:49,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 06:10:49,562 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 06:10:49,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 06:10:49,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 06:10:49,563 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 06:10:49,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 06:10:49,564 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 06:10:49,565 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 06:10:49,572 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 06:10:49,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 06:10:49,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 06:10:49,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 06:10:49,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 06:10:49,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 06:10:49,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 06:10:49,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 06:10:49,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 06:10:49,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 06:10:49,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 06:10:49,576 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 06:10:49,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 06:10:49,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:10:49,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 06:10:49,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 06:10:49,577 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 06:10:49,577 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 06:10:49,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 06:10:49,577 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 06:10:49,577 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 06:10:49,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 06:10:49,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 06:10:49,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 06:10:49,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 06:10:49,764 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 06:10:49,765 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound100.c [2022-04-08 06:10:49,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33aa8f05/156b289811bc4dfeb282767da1f1dbb8/FLAG1079451cd [2022-04-08 06:10:50,105 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 06:10:50,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound100.c [2022-04-08 06:10:50,110 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33aa8f05/156b289811bc4dfeb282767da1f1dbb8/FLAG1079451cd [2022-04-08 06:10:50,548 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33aa8f05/156b289811bc4dfeb282767da1f1dbb8 [2022-04-08 06:10:50,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 06:10:50,550 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 06:10:50,551 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 06:10:50,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 06:10:50,553 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 06:10:50,554 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e982818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50, skipping insertion in model container [2022-04-08 06:10:50,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 06:10:50,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 06:10:50,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound100.c[524,537] [2022-04-08 06:10:50,834 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:10:50,839 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 06:10:50,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound100.c[524,537] [2022-04-08 06:10:50,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 06:10:50,879 INFO L208 MainTranslator]: Completed translation [2022-04-08 06:10:50,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50 WrapperNode [2022-04-08 06:10:50,880 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 06:10:50,880 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 06:10:50,880 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 06:10:50,880 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 06:10:50,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,894 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,904 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,905 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 06:10:50,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 06:10:50,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 06:10:50,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 06:10:50,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (1/1) ... [2022-04-08 06:10:50,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 06:10:50,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:50,932 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 06:10:50,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 06:10:50,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 06:10:50,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 06:10:50,959 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 06:10:50,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 06:10:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 06:10:50,960 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 06:10:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 06:10:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 06:10:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 06:10:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 06:10:50,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 06:10:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 06:10:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 06:10:50,961 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 06:10:50,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 06:10:51,012 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 06:10:51,014 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 06:10:51,190 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 06:10:51,198 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 06:10:51,198 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 06:10:51,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:10:51 BoogieIcfgContainer [2022-04-08 06:10:51,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 06:10:51,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 06:10:51,200 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 06:10:51,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 06:10:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 06:10:50" (1/3) ... [2022-04-08 06:10:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47596bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:10:51, skipping insertion in model container [2022-04-08 06:10:51,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 06:10:50" (2/3) ... [2022-04-08 06:10:51,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47596bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 06:10:51, skipping insertion in model container [2022-04-08 06:10:51,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 06:10:51" (3/3) ... [2022-04-08 06:10:51,204 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound100.c [2022-04-08 06:10:51,207 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 06:10:51,207 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 06:10:51,233 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 06:10:51,237 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 06:10:51,237 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 06:10:51,250 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 06:10:51,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:10:51,255 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:51,255 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:10:51,255 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1790211013, now seen corresponding path program 1 times [2022-04-08 06:10:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:51,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841276329] [2022-04-08 06:10:51,270 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1790211013, now seen corresponding path program 2 times [2022-04-08 06:10:51,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:51,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521085740] [2022-04-08 06:10:51,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 06:10:51,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 06:10:51,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 06:10:51,393 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-08 06:10:51,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 06:10:51,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 06:10:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 06:10:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,405 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 06:10:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 06:10:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 06:10:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 06:10:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-08 06:10:51,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 06:10:51,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(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(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 06:10:51,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 06:10:51,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #73#return; {35#true} is VALID [2022-04-08 06:10:51,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-08 06:10:51,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-08 06:10:51,420 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 06:10:51,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,421 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 06:10:51,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-08 06:10:51,421 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 06:10:51,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,422 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 06:10:51,422 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35#true} is VALID [2022-04-08 06:10:51,422 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,423 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 06:10:51,423 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {35#true} is VALID [2022-04-08 06:10:51,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 06:10:51,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 06:10:51,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} #67#return; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {36#false} is VALID [2022-04-08 06:10:51,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 06:10:51,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 06:10:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:10:51,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:51,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521085740] [2022-04-08 06:10:51,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521085740] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:51,426 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:51,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:10:51,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:51,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841276329] [2022-04-08 06:10:51,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841276329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:51,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:51,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 06:10:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104276058] [2022-04-08 06:10:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:51,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:10:51,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:51,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:10:51,473 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 06:10:51,474 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 06:10:51,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:51,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 06:10:51,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 06:10:51,501 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:10:51,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:51,618 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-08 06:10:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 06:10:51,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-08 06:10:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:10:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:10:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-08 06:10:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:10:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-08 06:10:51,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-04-08 06:10:51,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:51,731 INFO L225 Difference]: With dead ends: 57 [2022-04-08 06:10:51,731 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 06:10:51,733 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 06:10:51,736 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 06:10:51,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 06:10:51,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 06:10:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 06:10:51,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:10:51,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:10:51,770 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:10:51,770 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:10:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:51,773 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-08 06:10:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 06:10:51,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:51,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:51,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-08 06:10:51,774 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-08 06:10:51,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:10:51,776 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-08 06:10:51,777 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 06:10:51,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:10:51,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:10:51,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:10:51,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:10:51,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 06:10:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-08 06:10:51,780 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 33 [2022-04-08 06:10:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:10:51,780 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-08 06:10:51,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 06:10:51,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-08 06:10:51,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:10:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-08 06:10:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 06:10:51,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:10:51,826 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:10:51,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 06:10:51,826 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:10:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:10:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash -102231875, now seen corresponding path program 1 times [2022-04-08 06:10:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1607101062] [2022-04-08 06:10:51,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:10:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash -102231875, now seen corresponding path program 2 times [2022-04-08 06:10:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:10:51,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822841862] [2022-04-08 06:10:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:10:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:10:51,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:10:51,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924271640] [2022-04-08 06:10:51,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:10:51,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:10:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:10:51,880 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:10:51,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 06:10:51,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 06:10:51,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:10:51,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 06:10:51,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:10:51,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:10:53,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {281#true} call ULTIMATE.init(); {281#true} is VALID [2022-04-08 06:10:53,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {281#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(13, 2);call #Ultimate.allocInit(12, 3); {281#true} is VALID [2022-04-08 06:10:53,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:10:53,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {281#true} {281#true} #73#return; {281#true} is VALID [2022-04-08 06:10:53,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {281#true} call #t~ret6 := main(); {281#true} is VALID [2022-04-08 06:10:53,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {281#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {281#true} is VALID [2022-04-08 06:10:53,041 INFO L272 TraceCheckUtils]: 6: Hoare triple {281#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {281#true} is VALID [2022-04-08 06:10:53,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:10:53,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:10:53,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:10:53,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {281#true} {281#true} #61#return; {281#true} is VALID [2022-04-08 06:10:53,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {281#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {281#true} is VALID [2022-04-08 06:10:53,042 INFO L272 TraceCheckUtils]: 12: Hoare triple {281#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {281#true} is VALID [2022-04-08 06:10:53,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:10:53,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:10:53,042 INFO L290 TraceCheckUtils]: 15: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:10:53,042 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {281#true} {281#true} #63#return; {281#true} is VALID [2022-04-08 06:10:53,042 INFO L272 TraceCheckUtils]: 17: Hoare triple {281#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {281#true} is VALID [2022-04-08 06:10:53,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:10:53,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:10:53,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:10:53,043 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {281#true} {281#true} #65#return; {281#true} is VALID [2022-04-08 06:10:53,043 INFO L272 TraceCheckUtils]: 22: Hoare triple {281#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {281#true} is VALID [2022-04-08 06:10:53,043 INFO L290 TraceCheckUtils]: 23: Hoare triple {281#true} ~cond := #in~cond; {281#true} is VALID [2022-04-08 06:10:53,043 INFO L290 TraceCheckUtils]: 24: Hoare triple {281#true} assume !(0 == ~cond); {281#true} is VALID [2022-04-08 06:10:53,043 INFO L290 TraceCheckUtils]: 25: Hoare triple {281#true} assume true; {281#true} is VALID [2022-04-08 06:10:53,043 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {281#true} {281#true} #67#return; {281#true} is VALID [2022-04-08 06:10:55,048 WARN L290 TraceCheckUtils]: 27: Hoare triple {281#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {367#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is UNKNOWN [2022-04-08 06:10:55,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !false; {367#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-08 06:10:57,052 WARN L272 TraceCheckUtils]: 29: Hoare triple {367#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {374#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 06:10:57,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {374#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {378#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:10:57,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {378#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {282#false} is VALID [2022-04-08 06:10:57,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {282#false} assume !false; {282#false} is VALID [2022-04-08 06:10:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:10:57,061 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 06:10:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:10:57,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822841862] [2022-04-08 06:10:57,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:10:57,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924271640] [2022-04-08 06:10:57,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924271640] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:57,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:57,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:10:57,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:10:57,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1607101062] [2022-04-08 06:10:57,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1607101062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:10:57,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:10:57,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 06:10:57,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653897739] [2022-04-08 06:10:57,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:10:57,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 06:10:57,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:10:57,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:10:59,647 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 06:10:59,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 06:10:59,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:10:59,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 06:10:59,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 06:10:59,648 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:11:03,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 06:11:03,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:03,939 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-08 06:11:03,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 06:11:03,939 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-08 06:11:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:03,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:11:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 06:11:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:11:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 06:11:03,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-08 06:11:08,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 43 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:08,409 INFO L225 Difference]: With dead ends: 38 [2022-04-08 06:11:08,410 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 06:11:08,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 06:11:08,411 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 7 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:08,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 93 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-08 06:11:08,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 06:11:08,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-08 06:11:08,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:08,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:11:08,444 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:11:08,445 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:11:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:08,459 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 06:11:08,459 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 06:11:08,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:08,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:08,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 06:11:08,462 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-08 06:11:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:08,468 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-08 06:11:08,468 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 06:11:08,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:08,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:08,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:08,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:08,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 06:11:08,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-08 06:11:08,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 33 [2022-04-08 06:11:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:08,471 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-08 06:11:08,480 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-08 06:11:08,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-08 06:11:11,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-08 06:11:11,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-08 06:11:11,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 06:11:11,325 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 06:11:11,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 06:11:11,525 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 06:11:11,526 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 06:11:11,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 06:11:11,526 INFO L85 PathProgramCache]: Analyzing trace with hash -453872510, now seen corresponding path program 1 times [2022-04-08 06:11:11,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:11,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408630056] [2022-04-08 06:11:11,527 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 06:11:11,527 INFO L85 PathProgramCache]: Analyzing trace with hash -453872510, now seen corresponding path program 2 times [2022-04-08 06:11:11,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 06:11:11,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6873359] [2022-04-08 06:11:11,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 06:11:11,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 06:11:11,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 06:11:11,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884619662] [2022-04-08 06:11:11,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 06:11:11,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 06:11:11,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 06:11:11,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 06:11:11,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 06:11:11,642 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 06:11:11,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 06:11:11,643 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 06:11:11,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 06:11:11,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 06:11:11,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-08 06:11:11,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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(13, 2);call #Ultimate.allocInit(12, 3); {604#true} is VALID [2022-04-08 06:11:11,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:11,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #73#return; {604#true} is VALID [2022-04-08 06:11:11,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret6 := main(); {604#true} is VALID [2022-04-08 06:11:11,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {604#true} is VALID [2022-04-08 06:11:11,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:11,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:11,886 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:11,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:11,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #61#return; {604#true} is VALID [2022-04-08 06:11:11,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-08 06:11:11,887 INFO L272 TraceCheckUtils]: 12: Hoare triple {604#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:11,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:11,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:11,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:11,888 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {604#true} {604#true} #63#return; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L272 TraceCheckUtils]: 17: Hoare triple {604#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {604#true} {604#true} #65#return; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L272 TraceCheckUtils]: 22: Hoare triple {604#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:11,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:11,889 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {604#true} {604#true} #67#return; {604#true} is VALID [2022-04-08 06:11:11,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {604#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {604#true} is VALID [2022-04-08 06:11:11,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {604#true} assume !false; {604#true} is VALID [2022-04-08 06:11:11,890 INFO L272 TraceCheckUtils]: 29: Hoare triple {604#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:11,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {604#true} ~cond := #in~cond; {699#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:11:11,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {699#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:11:11,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {703#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:11:11,893 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {703#(not (= |__VERIFIER_assert_#in~cond| 0))} {604#true} #69#return; {710#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-08 06:11:11,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {710#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {714#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 06:11:11,895 INFO L272 TraceCheckUtils]: 35: Hoare triple {714#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:11:11,896 INFO L290 TraceCheckUtils]: 36: Hoare triple {718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:11:11,902 INFO L290 TraceCheckUtils]: 37: Hoare triple {722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-08 06:11:11,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-08 06:11:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:11:11,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 06:11:12,333 INFO L290 TraceCheckUtils]: 38: Hoare triple {605#false} assume !false; {605#false} is VALID [2022-04-08 06:11:12,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {722#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {605#false} is VALID [2022-04-08 06:11:12,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {718#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {722#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 06:11:12,335 INFO L272 TraceCheckUtils]: 35: Hoare triple {714#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {718#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 06:11:12,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {741#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {714#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-08 06:11:12,336 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {703#(not (= |__VERIFIER_assert_#in~cond| 0))} {604#true} #69#return; {741#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-08 06:11:12,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {703#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:11:12,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {703#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 06:11:12,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {604#true} ~cond := #in~cond; {754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 06:11:12,337 INFO L272 TraceCheckUtils]: 29: Hoare triple {604#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {604#true} assume !false; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {604#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {604#true} {604#true} #67#return; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L272 TraceCheckUtils]: 22: Hoare triple {604#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:12,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {604#true} {604#true} #65#return; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:12,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L272 TraceCheckUtils]: 17: Hoare triple {604#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:12,339 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {604#true} {604#true} #63#return; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {604#true} call assume_abort_if_not((if ~R~0 >= 0 && ~R~0 <= 100 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {604#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {604#true} {604#true} #61#return; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {604#true} assume !(0 == ~cond); {604#true} is VALID [2022-04-08 06:11:12,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {604#true} ~cond := #in~cond; {604#true} is VALID [2022-04-08 06:11:12,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {604#true} call assume_abort_if_not((if ~A~0 >= 0 && ~A~0 <= 100 then 1 else 0)); {604#true} is VALID [2022-04-08 06:11:12,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {604#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4; {604#true} is VALID [2022-04-08 06:11:12,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {604#true} call #t~ret6 := main(); {604#true} is VALID [2022-04-08 06:11:12,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {604#true} {604#true} #73#return; {604#true} is VALID [2022-04-08 06:11:12,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {604#true} assume true; {604#true} is VALID [2022-04-08 06:11:12,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {604#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(13, 2);call #Ultimate.allocInit(12, 3); {604#true} is VALID [2022-04-08 06:11:12,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {604#true} call ULTIMATE.init(); {604#true} is VALID [2022-04-08 06:11:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 06:11:12,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 06:11:12,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6873359] [2022-04-08 06:11:12,375 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 06:11:12,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884619662] [2022-04-08 06:11:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884619662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 06:11:12,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 06:11:12,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 06:11:12,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 06:11:12,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408630056] [2022-04-08 06:11:12,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408630056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 06:11:12,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 06:11:12,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 06:11:12,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239403019] [2022-04-08 06:11:12,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 06:11:12,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-08 06:11:12,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 06:11:12,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:11:12,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:12,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 06:11:12,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 06:11:12,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 06:11:12,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 06:11:12,397 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:11:12,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:12,920 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-08 06:11:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 06:11:12,920 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 39 [2022-04-08 06:11:12,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 06:11:12,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:11:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 06:11:12,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:11:12,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-08 06:11:12,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-08 06:11:12,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:12,978 INFO L225 Difference]: With dead ends: 35 [2022-04-08 06:11:12,979 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 06:11:12,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-08 06:11:12,980 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 10 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 06:11:12,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 06:11:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 06:11:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 06:11:12,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 06:11:12,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:11:12,981 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:11:12,981 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:11:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:12,981 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:11:12,981 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:11:12,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:12,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:12,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 06:11:12,982 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 06:11:12,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 06:11:12,982 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 06:11:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:11:12,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:12,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 06:11:12,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 06:11:12,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 06:11:12,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 06:11:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 06:11:12,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-04-08 06:11:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 06:11:12,982 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 06:11:12,982 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 06:11:12,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 06:11:12,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 06:11:12,983 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 06:11:12,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 06:11:12,984 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 06:11:13,006 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 06:11:13,203 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 06:11:13,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 06:11:13,350 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 5) no Hoare annotation was computed. [2022-04-08 06:11:13,350 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 5) no Hoare annotation was computed. [2022-04-08 06:11:13,350 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 5) no Hoare annotation was computed. [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L9(line 9) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L9-2(lines 8 10) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 8 10) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 46) the Hoare annotation is: (let ((.cse0 (+ (* main_~v~0 2) (* main_~u~0 main_~u~0))) (.cse1 (* main_~v~0 main_~v~0)) (.cse2 (* main_~u~0 2)) (.cse3 (* main_~A~0 4))) (and (= .cse0 (+ .cse1 .cse2 .cse3 (* main_~r~0 4))) (= .cse0 (+ .cse1 .cse2 .cse3)))) [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 19 51) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-08 06:11:13,351 INFO L885 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 19 51) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-08 06:11:13,352 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 35 46) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 51) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L878 garLoopResultBuilder]: At program point L39(lines 39 45) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-08 06:11:13,352 INFO L878 garLoopResultBuilder]: At program point L39-2(lines 35 46) the Hoare annotation is: (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4))) [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,352 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 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,352 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 06:11:13,353 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-08 06:11:13,353 INFO L878 garLoopResultBuilder]: At program point L13(lines 13 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:11:13,353 INFO L878 garLoopResultBuilder]: At program point L12(lines 12 15) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:11:13,353 INFO L878 garLoopResultBuilder]: At program point L12-2(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:11:13,353 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 11 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 06:11:13,353 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 06:11:13,355 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 06:11:13,356 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 06:11:13,358 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 06:11:13,364 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 06:11:13,377 INFO L163 areAnnotationChecker]: CFG has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 06:11:13,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 06:11:13 BoogieIcfgContainer [2022-04-08 06:11:13,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 06:11:13,388 INFO L158 Benchmark]: Toolchain (without parser) took 22837.21ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 136.6MB in the beginning and 195.7MB in the end (delta: -59.2MB). Peak memory consumption was 14.8MB. Max. memory is 8.0GB. [2022-04-08 06:11:13,388 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 152.5MB in the beginning and 152.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 06:11:13,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.73ms. Allocated memory is still 185.6MB. Free memory was 136.4MB in the beginning and 160.9MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 06:11:13,389 INFO L158 Benchmark]: Boogie Preprocessor took 25.60ms. Allocated memory is still 185.6MB. Free memory was 160.9MB in the beginning and 159.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 06:11:13,389 INFO L158 Benchmark]: RCFGBuilder took 292.90ms. Allocated memory is still 185.6MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 06:11:13,389 INFO L158 Benchmark]: TraceAbstraction took 22186.47ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 147.2MB in the beginning and 195.7MB in the end (delta: -48.6MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. [2022-04-08 06:11:13,390 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 185.6MB. Free memory was 152.5MB in the beginning and 152.4MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 328.73ms. Allocated memory is still 185.6MB. Free memory was 136.4MB in the beginning and 160.9MB in the end (delta: -24.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.60ms. Allocated memory is still 185.6MB. Free memory was 160.9MB in the beginning and 159.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 292.90ms. Allocated memory is still 185.6MB. Free memory was 159.2MB in the beginning and 147.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 22186.47ms. Allocated memory was 185.6MB in the beginning and 259.0MB in the end (delta: 73.4MB). Free memory was 147.2MB in the beginning and 195.7MB in the end (delta: -48.6MB). Peak memory consumption was 25.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 42 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 181 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 97 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 80 mSDtfsCounter, 97 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=2, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 80 PreInvPairs, 115 NumberOfFragments, 184 HoareAnnotationTreeSize, 80 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 276 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: 35]: Loop Invariant Derived loop invariant: v * 2 + u * u == v * v + u * 2 + A * 4 + r * 4 - ProcedureContractResult [Line: 8]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 11]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-08 06:11:13,425 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...