/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench/mannadiv.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 10:51:53,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 10:51:53,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 10:51:53,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 10:51:53,163 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 10:51:53,164 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 10:51:53,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 10:51:53,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 10:51:53,169 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 10:51:53,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 10:51:53,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 10:51:53,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 10:51:53,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 10:51:53,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 10:51:53,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 10:51:53,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 10:51:53,179 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 10:51:53,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 10:51:53,181 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 10:51:53,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 10:51:53,186 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 10:51:53,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 10:51:53,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 10:51:53,188 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 10:51:53,189 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 10:51:53,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 10:51:53,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 10:51:53,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 10:51:53,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 10:51:53,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 10:51:53,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 10:51:53,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 10:51:53,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 10:51:53,197 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 10:51:53,198 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 10:51:53,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 10:51:53,199 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 10:51:53,199 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 10:51:53,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 10:51:53,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 10:51:53,200 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 10:51:53,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 10:51:53,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 10:51:53,209 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 10:51:53,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 10:51:53,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 10:51:53,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 10:51:53,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 10:51:53,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 10:51:53,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 10:51:53,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 10:51:53,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 10:51:53,211 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 10:51:53,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 10:51:53,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:51:53,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 10:51:53,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 10:51:53,213 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 10:51:53,213 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 10:51:53,403 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 10:51:53,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 10:51:53,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 10:51:53,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 10:51:53,427 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 10:51:53,428 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-08 10:51:53,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae78aac9a/e47755718c374ee6b51dfc7c12209690/FLAGc54644526 [2022-04-08 10:51:53,878 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 10:51:53,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/mannadiv.c [2022-04-08 10:51:53,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae78aac9a/e47755718c374ee6b51dfc7c12209690/FLAGc54644526 [2022-04-08 10:51:53,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae78aac9a/e47755718c374ee6b51dfc7c12209690 [2022-04-08 10:51:53,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 10:51:53,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 10:51:53,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 10:51:53,909 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 10:51:53,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 10:51:53,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:51:53" (1/1) ... [2022-04-08 10:51:53,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b98c413 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:53, skipping insertion in model container [2022-04-08 10:51:53,915 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 10:51:53" (1/1) ... [2022-04-08 10:51:53,921 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 10:51:53,934 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 10:51:54,098 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/mannadiv.c[573,586] [2022-04-08 10:51:54,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:51:54,122 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 10:51:54,134 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/mannadiv.c[573,586] [2022-04-08 10:51:54,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 10:51:54,179 INFO L208 MainTranslator]: Completed translation [2022-04-08 10:51:54,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54 WrapperNode [2022-04-08 10:51:54,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 10:51:54,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 10:51:54,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 10:51:54,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 10:51:54,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,201 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,210 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 10:51:54,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 10:51:54,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 10:51:54,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 10:51:54,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (1/1) ... [2022-04-08 10:51:54,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 10:51:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:51:54,244 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 10:51:54,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 10:51:54,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 10:51:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 10:51:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 10:51:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 10:51:54,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 10:51:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 10:51:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 10:51:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 10:51:54,277 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 10:51:54,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 10:51:54,320 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 10:51:54,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 10:51:54,437 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 10:51:54,441 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 10:51:54,442 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 10:51:54,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:51:54 BoogieIcfgContainer [2022-04-08 10:51:54,443 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 10:51:54,446 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 10:51:54,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 10:51:54,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 10:51:54,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 10:51:53" (1/3) ... [2022-04-08 10:51:54,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4e6b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:51:54, skipping insertion in model container [2022-04-08 10:51:54,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 10:51:54" (2/3) ... [2022-04-08 10:51:54,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4e6b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 10:51:54, skipping insertion in model container [2022-04-08 10:51:54,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 10:51:54" (3/3) ... [2022-04-08 10:51:54,471 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv.c [2022-04-08 10:51:54,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 10:51:54,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 10:51:54,513 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 10:51:54,518 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 10:51:54,518 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 10:51:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 10:51:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:51:54,538 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:51:54,538 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:51:54,538 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:51:54,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:51:54,543 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 1 times [2022-04-08 10:51:54,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:51:54,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [527194041] [2022-04-08 10:51:54,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:51:54,558 INFO L85 PathProgramCache]: Analyzing trace with hash -786972844, now seen corresponding path program 2 times [2022-04-08 10:51:54,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:51:54,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042432460] [2022-04-08 10:51:54,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:51:54,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:51:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:54,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 10:51:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:54,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 10:51:54,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:51:54,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-08 10:51:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 10:51:54,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:54,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:51:54,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 10:51:54,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 10:51:54,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-08 10:51:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-08 10:51:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:54,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:51:54,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 10:51:54,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 10:51:54,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-08 10:51:54,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 10:51:54,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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(11, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-08 10:51:54,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-08 10:51:54,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #66#return; {32#true} is VALID [2022-04-08 10:51:54,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2022-04-08 10:51:54,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {32#true} is VALID [2022-04-08 10:51:54,784 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {32#true} is VALID [2022-04-08 10:51:54,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:51:54,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 10:51:54,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 10:51:54,787 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#false} {32#true} #58#return; {33#false} is VALID [2022-04-08 10:51:54,787 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {32#true} is VALID [2022-04-08 10:51:54,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#true} ~cond := #in~cond; {32#true} is VALID [2022-04-08 10:51:54,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#true} assume 0 == ~cond;assume false; {33#false} is VALID [2022-04-08 10:51:54,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#false} assume true; {33#false} is VALID [2022-04-08 10:51:54,788 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {33#false} {33#false} #60#return; {33#false} is VALID [2022-04-08 10:51:54,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {33#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {33#false} is VALID [2022-04-08 10:51:54,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {33#false} assume !true; {33#false} is VALID [2022-04-08 10:51:54,789 INFO L272 TraceCheckUtils]: 18: Hoare triple {33#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {33#false} is VALID [2022-04-08 10:51:54,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2022-04-08 10:51:54,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2022-04-08 10:51:54,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-08 10:51:54,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:51:54,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:51:54,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042432460] [2022-04-08 10:51:54,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042432460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:51:54,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:51:54,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:51:54,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:51:54,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [527194041] [2022-04-08 10:51:54,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [527194041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:51:54,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:51:54,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 10:51:54,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714216328] [2022-04-08 10:51:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:51:54,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:51:54,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:51:54,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:51:54,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:54,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 10:51:54,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:51:54,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 10:51:54,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:51:54,880 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:51:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,018 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-08 10:51:55,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 10:51:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 10:51:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:51:55,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:51:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 10:51:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:51:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-08 10:51:55,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-08 10:51:55,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:55,136 INFO L225 Difference]: With dead ends: 51 [2022-04-08 10:51:55,136 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 10:51:55,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 10:51:55,141 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:51:55,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:51:55,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 10:51:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-08 10:51:55,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:51:55,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:51:55,167 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:51:55,167 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:51:55,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,170 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:51:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:51:55,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:51:55,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:51:55,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 10:51:55,171 INFO L87 Difference]: Start difference. First operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 24 states. [2022-04-08 10:51:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,173 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-08 10:51:55,173 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:51:55,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:51:55,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:51:55,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:51:55,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:51:55,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 10:51:55,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-08 10:51:55,176 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 22 [2022-04-08 10:51:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:51:55,177 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-08 10:51:55,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 10:51:55,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-08 10:51:55,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-08 10:51:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 10:51:55,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:51:55,207 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:51:55,208 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 10:51:55,208 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:51:55,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:51:55,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 1 times [2022-04-08 10:51:55,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:51:55,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142291535] [2022-04-08 10:51:55,209 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:51:55,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1131020600, now seen corresponding path program 2 times [2022-04-08 10:51:55,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:51:55,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175668580] [2022-04-08 10:51:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:51:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:51:55,223 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:51:55,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217749223] [2022-04-08 10:51:55,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:51:55,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:51:55,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:51:55,225 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:51:55,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 10:51:55,261 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 10:51:55,261 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:51:55,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 10:51:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:55,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:51:55,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {246#true} call ULTIMATE.init(); {246#true} is VALID [2022-04-08 10:51:55,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {246#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(11, 2);call #Ultimate.allocInit(12, 3); {246#true} is VALID [2022-04-08 10:51:55,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 10:51:55,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {246#true} {246#true} #66#return; {246#true} is VALID [2022-04-08 10:51:55,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {246#true} call #t~ret6 := main(); {246#true} is VALID [2022-04-08 10:51:55,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {246#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {246#true} is VALID [2022-04-08 10:51:55,413 INFO L272 TraceCheckUtils]: 6: Hoare triple {246#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {246#true} is VALID [2022-04-08 10:51:55,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 10:51:55,414 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 10:51:55,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 10:51:55,415 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#true} {246#true} #58#return; {246#true} is VALID [2022-04-08 10:51:55,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {246#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {246#true} is VALID [2022-04-08 10:51:55,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#true} ~cond := #in~cond; {246#true} is VALID [2022-04-08 10:51:55,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#true} assume !(0 == ~cond); {246#true} is VALID [2022-04-08 10:51:55,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#true} assume true; {246#true} is VALID [2022-04-08 10:51:55,433 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {246#true} {246#true} #60#return; {246#true} is VALID [2022-04-08 10:51:55,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-08 10:51:55,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !false; {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-08 10:51:55,435 INFO L272 TraceCheckUtils]: 18: Hoare triple {299#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {306#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:51:55,436 INFO L290 TraceCheckUtils]: 19: Hoare triple {306#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {310#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:55,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {310#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {247#false} is VALID [2022-04-08 10:51:55,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {247#false} assume !false; {247#false} is VALID [2022-04-08 10:51:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:51:55,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 10:51:55,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:51:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175668580] [2022-04-08 10:51:55,438 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:51:55,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217749223] [2022-04-08 10:51:55,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217749223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:51:55,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:51:55,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:51:55,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:51:55,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142291535] [2022-04-08 10:51:55,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142291535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:51:55,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:51:55,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 10:51:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527861397] [2022-04-08 10:51:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:51:55,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 10:51:55,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:51:55,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:51:55,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:55,457 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 10:51:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:51:55,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 10:51:55,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 10:51:55,459 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:51:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,582 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-08 10:51:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 10:51:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-08 10:51:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:51:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:51:55,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:51:55,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:51:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-08 10:51:55,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-08 10:51:55,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:55,624 INFO L225 Difference]: With dead ends: 35 [2022-04-08 10:51:55,625 INFO L226 Difference]: Without dead ends: 33 [2022-04-08 10:51:55,626 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 10:51:55,627 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:51:55,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 75 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:51:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-08 10:51:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-04-08 10:51:55,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:51:55,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:51:55,645 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:51:55,646 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:51:55,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,650 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 10:51:55,650 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 10:51:55,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:51:55,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:51:55,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 10:51:55,654 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-08 10:51:55,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:51:55,657 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-08 10:51:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-08 10:51:55,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:51:55,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:51:55,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:51:55,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:51:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 10:51:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-04-08 10:51:55,670 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2022-04-08 10:51:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:51:55,670 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-04-08 10:51:55,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-08 10:51:55,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 33 transitions. [2022-04-08 10:51:55,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:51:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-04-08 10:51:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 10:51:55,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 10:51:55,716 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 10:51:55,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 10:51:55,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:51:55,934 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 10:51:55,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 10:51:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 1 times [2022-04-08 10:51:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 10:51:55,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949650995] [2022-04-08 10:51:55,936 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 10:51:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1991967029, now seen corresponding path program 2 times [2022-04-08 10:51:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 10:51:55,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133048808] [2022-04-08 10:51:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 10:51:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 10:51:55,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 10:51:55,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [423106367] [2022-04-08 10:51:55,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 10:51:55,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 10:51:55,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 10:51:55,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 10:51:55,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 10:51:55,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 10:51:55,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 10:51:55,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 10:51:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 10:51:56,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 10:51:56,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-08 10:51:56,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#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(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-08 10:51:56,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:51:56,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-08 10:51:56,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-08 10:51:56,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-08 10:51:56,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:51:56,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 10:51:56,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 10:51:56,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:51:56,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-08 10:51:56,194 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:51:56,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 10:51:56,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 10:51:56,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:51:56,194 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-08 10:51:56,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-08 10:51:56,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-08 10:51:56,195 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:51:56,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:56,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {576#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:56,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:51:56,199 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-08 10:51:56,199 INFO L290 TraceCheckUtils]: 23: Hoare triple {587#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-08 10:51:56,200 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:51:56,200 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:51:56,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-08 10:51:56,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-08 10:51:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:51:56,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 10:52:02,673 INFO L290 TraceCheckUtils]: 27: Hoare triple {515#false} assume !false; {515#false} is VALID [2022-04-08 10:52:02,674 INFO L290 TraceCheckUtils]: 26: Hoare triple {599#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {515#false} is VALID [2022-04-08 10:52:02,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {595#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {599#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 10:52:02,675 INFO L272 TraceCheckUtils]: 24: Hoare triple {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {595#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 10:52:02,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {591#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-08 10:52:02,677 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} {514#true} #62#return; {618#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-08 10:52:02,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {580#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:02,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {580#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 10:52:02,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {514#true} ~cond := #in~cond; {631#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 10:52:02,678 INFO L272 TraceCheckUtils]: 18: Hoare triple {514#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:52:02,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {514#true} assume !false; {514#true} is VALID [2022-04-08 10:52:02,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {514#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {514#true} is VALID [2022-04-08 10:52:02,678 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {514#true} {514#true} #60#return; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {514#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:52:02,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {514#true} {514#true} #58#return; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {514#true} assume !(0 == ~cond); {514#true} is VALID [2022-04-08 10:52:02,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {514#true} ~cond := #in~cond; {514#true} is VALID [2022-04-08 10:52:02,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {514#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {514#true} is VALID [2022-04-08 10:52:02,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {514#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {514#true} is VALID [2022-04-08 10:52:02,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {514#true} call #t~ret6 := main(); {514#true} is VALID [2022-04-08 10:52:02,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {514#true} {514#true} #66#return; {514#true} is VALID [2022-04-08 10:52:02,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {514#true} assume true; {514#true} is VALID [2022-04-08 10:52:02,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {514#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(11, 2);call #Ultimate.allocInit(12, 3); {514#true} is VALID [2022-04-08 10:52:02,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {514#true} call ULTIMATE.init(); {514#true} is VALID [2022-04-08 10:52:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 10:52:02,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 10:52:02,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133048808] [2022-04-08 10:52:02,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 10:52:02,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423106367] [2022-04-08 10:52:02,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423106367] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 10:52:02,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 10:52:02,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 10:52:02,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 10:52:02,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949650995] [2022-04-08 10:52:02,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949650995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 10:52:02,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 10:52:02,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 10:52:02,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546638905] [2022-04-08 10:52:02,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 10:52:02,683 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 10:52:02,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 10:52:02,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:52:02,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:02,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 10:52:02,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 10:52:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 10:52:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 10:52:02,706 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:52:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:02,862 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-08 10:52:02,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 10:52:02,862 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 10:52:02,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 10:52:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:52:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:52:02,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:52:02,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-08 10:52:02,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-08 10:52:02,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:02,887 INFO L225 Difference]: With dead ends: 30 [2022-04-08 10:52:02,887 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 10:52:02,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 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 10:52:02,889 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 10:52:02,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 10:52:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 10:52:02,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 10:52:02,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 10:52:02,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:52:02,891 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:52:02,891 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:52:02,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:02,892 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:52:02,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:52:02,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:02,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:02,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:52:02,893 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 10:52:02,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 10:52:02,893 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 10:52:02,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:52:02,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:02,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 10:52:02,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 10:52:02,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 10:52:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 10:52:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 10:52:02,894 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-08 10:52:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 10:52:02,895 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 10:52:02,895 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 10:52:02,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 10:52:02,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 10:52:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 10:52:02,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 10:52:02,899 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 10:52:02,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 10:52:03,111 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-08 10:52:03,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 10:52:03,198 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 9) no Hoare annotation was computed. [2022-04-08 10:52:03,198 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 9) no Hoare annotation was computed. [2022-04-08 10:52:03,198 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 9) no Hoare annotation was computed. [2022-04-08 10:52:03,198 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 12 14) the Hoare annotation is: true [2022-04-08 10:52:03,198 INFO L885 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point L13-2(lines 12 14) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 12 14) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 48) the Hoare annotation is: (let ((.cse0 (* main_~x2~0 main_~y1~0))) (and (= (+ .cse0 main_~y3~0 main_~y2~0) main_~x1~0) (= (+ .cse0 main_~y2~0) main_~x1~0))) [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 51) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 51) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 47) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 10:52:03,199 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 10:52:03,199 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 10:52:03,199 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 35 48) the Hoare annotation is: (= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0) [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 22 51) the Hoare annotation is: true [2022-04-08 10:52:03,199 INFO L885 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: true [2022-04-08 10:52:03,200 INFO L885 garLoopResultBuilder]: At program point L28-1(line 28) the Hoare annotation is: true [2022-04-08 10:52:03,200 INFO L885 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: true [2022-04-08 10:52:03,200 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,200 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L878 garLoopResultBuilder]: At program point L17(lines 17 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:52:03,201 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:52:03,201 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 15 21) the Hoare annotation is: true [2022-04-08 10:52:03,201 INFO L878 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:52:03,201 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 15 21) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-08 10:52:03,201 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-08 10:52:03,203 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2] [2022-04-08 10:52:03,204 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 10:52:03,206 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 10:52:03,209 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 10:52:03,216 INFO L163 areAnnotationChecker]: CFG has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 10:52:03,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 10:52:03 BoogieIcfgContainer [2022-04-08 10:52:03,222 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 10:52:03,223 INFO L158 Benchmark]: Toolchain (without parser) took 9321.32ms. Allocated memory was 215.0MB in the beginning and 257.9MB in the end (delta: 43.0MB). Free memory was 164.9MB in the beginning and 130.0MB in the end (delta: 34.9MB). Peak memory consumption was 78.5MB. Max. memory is 8.0GB. [2022-04-08 10:52:03,223 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 215.0MB. Free memory was 181.5MB in the beginning and 181.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 10:52:03,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.30ms. Allocated memory is still 215.0MB. Free memory was 164.7MB in the beginning and 191.0MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 10:52:03,224 INFO L158 Benchmark]: Boogie Preprocessor took 34.43ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 189.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 10:52:03,224 INFO L158 Benchmark]: RCFGBuilder took 227.33ms. Allocated memory is still 215.0MB. Free memory was 189.5MB in the beginning and 179.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 10:52:03,224 INFO L158 Benchmark]: TraceAbstraction took 8775.98ms. Allocated memory was 215.0MB in the beginning and 257.9MB in the end (delta: 43.0MB). Free memory was 178.4MB in the beginning and 130.0MB in the end (delta: 48.5MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2022-04-08 10:52:03,225 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.12ms. Allocated memory is still 215.0MB. Free memory was 181.5MB in the beginning and 181.3MB in the end (delta: 151.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.30ms. Allocated memory is still 215.0MB. Free memory was 164.7MB in the beginning and 191.0MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.43ms. Allocated memory is still 215.0MB. Free memory was 191.0MB in the beginning and 189.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 227.33ms. Allocated memory is still 215.0MB. Free memory was 189.5MB in the beginning and 179.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8775.98ms. Allocated memory was 215.0MB in the beginning and 257.9MB in the end (delta: 43.0MB). Free memory was 178.4MB in the beginning and 130.0MB in the end (delta: 48.5MB). Peak memory consumption was 92.3MB. 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: 18]: 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, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.7s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 140 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 67 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 61 PreInvPairs, 87 NumberOfFragments, 105 HoareAnnotationTreeSize, 61 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 98 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: x2 * y1 + y3 + y2 == x1 - ProcedureContractResult [Line: 12]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 15]: 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 10:52:03,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...