/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 10:19:36,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 10:19:36,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 10:19:36,202 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 10:19:36,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 10:19:36,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 10:19:36,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 10:19:36,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 10:19:36,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 10:19:36,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 10:19:36,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 10:19:36,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 10:19:36,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 10:19:36,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 10:19:36,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 10:19:36,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 10:19:36,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 10:19:36,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 10:19:36,216 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 10:19:36,217 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 10:19:36,218 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 10:19:36,219 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 10:19:36,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 10:19:36,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 10:19:36,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 10:19:36,222 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 10:19:36,222 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 10:19:36,223 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 10:19:36,223 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 10:19:36,223 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 10:19:36,224 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 10:19:36,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 10:19:36,224 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 10:19:36,225 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 10:19:36,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 10:19:36,226 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 10:19:36,226 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 10:19:36,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 10:19:36,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 10:19:36,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 10:19:36,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 10:19:36,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 10:19:36,229 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 10:19:36,237 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 10:19:36,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 10:19:36,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 10:19:36,238 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 10:19:36,238 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 10:19:36,238 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 10:19:36,239 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 10:19:36,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:19:36,240 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 10:19:36,240 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 10:19:36,241 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 10:19:36,241 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 10:19:36,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 10:19:36,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 10:19:36,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 10:19:36,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 10:19:36,446 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 10:19:36,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-15 10:19:36,489 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d0d090d/1e9a97d8998b43c7bc12f9d6f9827dec/FLAGbddeb64ed [2022-04-15 10:19:36,844 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 10:19:36,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-15 10:19:36,848 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d0d090d/1e9a97d8998b43c7bc12f9d6f9827dec/FLAGbddeb64ed [2022-04-15 10:19:36,857 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80d0d090d/1e9a97d8998b43c7bc12f9d6f9827dec [2022-04-15 10:19:36,859 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 10:19:36,860 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 10:19:36,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 10:19:36,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 10:19:36,866 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 10:19:36,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:19:36" (1/1) ... [2022-04-15 10:19:36,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d71b8dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:36, skipping insertion in model container [2022-04-15 10:19:36,871 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 10:19:36" (1/1) ... [2022-04-15 10:19:36,875 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 10:19:36,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 10:19:37,003 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c[573,586] [2022-04-15 10:19:37,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:19:37,045 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 10:19:37,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c[573,586] [2022-04-15 10:19:37,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 10:19:37,069 INFO L208 MainTranslator]: Completed translation [2022-04-15 10:19:37,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37 WrapperNode [2022-04-15 10:19:37,069 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 10:19:37,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 10:19:37,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 10:19:37,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 10:19:37,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 10:19:37,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 10:19:37,088 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 10:19:37,088 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 10:19:37,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (1/1) ... [2022-04-15 10:19:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 10:19:37,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:37,107 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 10:19:37,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 10:19:37,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 10:19:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 10:19:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 10:19:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 10:19:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 10:19:37,135 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 10:19:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 10:19:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 10:19:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 10:19:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 10:19:37,136 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 10:19:37,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 10:19:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 10:19:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 10:19:37,180 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 10:19:37,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 10:19:37,293 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 10:19:37,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 10:19:37,298 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 10:19:37,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:19:37 BoogieIcfgContainer [2022-04-15 10:19:37,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 10:19:37,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 10:19:37,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 10:19:37,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 10:19:37,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 10:19:36" (1/3) ... [2022-04-15 10:19:37,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae9e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:19:37, skipping insertion in model container [2022-04-15 10:19:37,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 10:19:37" (2/3) ... [2022-04-15 10:19:37,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae9e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 10:19:37, skipping insertion in model container [2022-04-15 10:19:37,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 10:19:37" (3/3) ... [2022-04-15 10:19:37,319 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2022-04-15 10:19:37,322 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 10:19:37,322 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 10:19:37,374 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 10:19:37,378 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 10:19:37,378 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 10:19:37,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-15 10:19:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 10:19:37,401 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:37,402 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-15 10:19:37,402 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:37,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:37,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-15 10:19:37,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:37,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2001432419] [2022-04-15 10:19:37,423 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:37,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-15 10:19:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:37,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063902006] [2022-04-15 10:19:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 10:19:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:37,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {33#true} is VALID [2022-04-15 10:19:37,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 10:19:37,601 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-15 10:19:37,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 10:19:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:37,613 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:19:37,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:19:37,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:19:37,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-15 10:19:37,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 10:19:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:37,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:19:37,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:19:37,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:19:37,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-15 10:19:37,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 10:19:37,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#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);~counter~0 := 0; {33#true} is VALID [2022-04-15 10:19:37,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-15 10:19:37,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-15 10:19:37,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-15 10:19:37,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#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; {33#true} is VALID [2022-04-15 10:19:37,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-15 10:19:37,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:19:37,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:19:37,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:19:37,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-15 10:19:37,633 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-15 10:19:37,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-15 10:19:37,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-15 10:19:37,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-15 10:19:37,634 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-15 10:19:37,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-15 10:19:37,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-15 10:19:37,635 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-15 10:19:37,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-15 10:19:37,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-15 10:19:37,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-15 10:19:37,637 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-15 10:19:37,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:37,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063902006] [2022-04-15 10:19:37,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063902006] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:37,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:19:37,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:37,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2001432419] [2022-04-15 10:19:37,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2001432419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:37,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:37,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 10:19:37,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867676518] [2022-04-15 10:19:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:37,651 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-15 10:19:37,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:37,654 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-15 10:19:37,679 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-15 10:19:37,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 10:19:37,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:37,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 10:19:37,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 10:19:37,701 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-15 10:19:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:37,834 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-15 10:19:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 10:19:37,834 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-15 10:19:37,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:37,835 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-15 10:19:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-15 10:19:37,846 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-15 10:19:37,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-15 10:19:37,853 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-15 10:19:37,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:37,937 INFO L225 Difference]: With dead ends: 54 [2022-04-15 10:19:37,937 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 10:19:37,939 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-15 10:19:37,942 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:37,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:37,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 10:19:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-15 10:19:37,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:37,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-15 10:19:37,964 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-15 10:19:37,964 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-15 10:19:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:37,966 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 10:19:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 10:19:37,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:37,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:37,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 26 states. [2022-04-15 10:19:37,967 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 26 states. [2022-04-15 10:19:37,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:37,969 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-15 10:19:37,969 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-15 10:19:37,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:37,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:37,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:37,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:37,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-15 10:19:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-15 10:19:37,989 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-15 10:19:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:37,989 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-15 10:19:37,990 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-15 10:19:37,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-15 10:19:38,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 10:19:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 10:19:38,018 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:38,018 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:38,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 10:19:38,019 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:38,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-15 10:19:38,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:38,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [243720067] [2022-04-15 10:19:38,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-15 10:19:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:38,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762529642] [2022-04-15 10:19:38,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:38,044 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:38,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390936617] [2022-04-15 10:19:38,044 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:19:38,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:38,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:38,046 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:38,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 10:19:38,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:19:38,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:38,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 10:19:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:38,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:38,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-15 10:19:38,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#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);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,260 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} 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; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:38,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID [2022-04-15 10:19:38,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {260#false} is VALID [2022-04-15 10:19:38,267 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID [2022-04-15 10:19:38,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2022-04-15 10:19:38,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID [2022-04-15 10:19:38,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-15 10:19:38,267 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-15 10:19:38,267 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:19:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762529642] [2022-04-15 10:19:38,268 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390936617] [2022-04-15 10:19:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390936617] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:38,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:38,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:19:38,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:38,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [243720067] [2022-04-15 10:19:38,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [243720067] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 10:19:38,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599568230] [2022-04-15 10:19:38,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:38,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 10:19:38,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:38,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:19:38,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,284 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 10:19:38,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:38,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 10:19:38,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:19:38,284 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:19:38,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,327 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 10:19:38,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 10:19:38,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 10:19:38,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:19:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 10:19:38,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:19:38,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 10:19:38,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 10:19:38,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,354 INFO L225 Difference]: With dead ends: 34 [2022-04-15 10:19:38,354 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 10:19:38,355 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 10:19:38,355 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:38,356 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:38,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 10:19:38,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 10:19:38,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:38,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-15 10:19:38,366 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-15 10:19:38,366 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-15 10:19:38,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,367 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 10:19:38,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 10:19:38,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:38,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:38,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-15 10:19:38,368 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-15 10:19:38,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,370 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 10:19:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 10:19:38,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:38,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:38,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:38,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-15 10:19:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 10:19:38,372 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-15 10:19:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:38,372 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 10:19:38,372 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 10:19:38,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 10:19:38,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,395 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 10:19:38,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 10:19:38,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:38,395 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:38,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:38,614 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-15 10:19:38,615 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:38,615 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-15 10:19:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856244118] [2022-04-15 10:19:38,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:38,616 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-15 10:19:38,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:38,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731120086] [2022-04-15 10:19:38,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:38,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:38,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:38,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1294955499] [2022-04-15 10:19:38,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:19:38,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:38,633 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:38,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 10:19:38,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 10:19:38,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:38,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 10:19:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:38,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:38,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-15 10:19:38,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#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);~counter~0 := 0; {507#true} is VALID [2022-04-15 10:19:38,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 10:19:38,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID [2022-04-15 10:19:38,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2022-04-15 10:19:38,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#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; {507#true} is VALID [2022-04-15 10:19:38,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID [2022-04-15 10:19:38,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-15 10:19:38,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-15 10:19:38,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 10:19:38,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID [2022-04-15 10:19:38,803 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID [2022-04-15 10:19:38,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-15 10:19:38,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-15 10:19:38,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-15 10:19:38,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-15 10:19:38,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 10:19:38,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 10:19:38,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 5);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-15 10:19:38,805 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(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)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:19:38,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:19:38,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-15 10:19:38,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-15 10:19:38,806 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-15 10:19:38,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 10:19:38,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:38,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731120086] [2022-04-15 10:19:38,806 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:38,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294955499] [2022-04-15 10:19:38,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294955499] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:38,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:38,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:19:38,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:38,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856244118] [2022-04-15 10:19:38,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856244118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:38,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:38,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:19:38,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629594914] [2022-04-15 10:19:38,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:38,808 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-15 10:19:38,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:38,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 10:19:38,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:19:38,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:38,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:19:38,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 10:19:38,821 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 10:19:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,923 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 10:19:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 10:19:38,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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 23 [2022-04-15 10:19:38,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 10:19:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 10:19:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 10:19:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-15 10:19:38,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-15 10:19:38,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:38,960 INFO L225 Difference]: With dead ends: 37 [2022-04-15 10:19:38,960 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 10:19:38,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 10:19:38,961 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 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-15 10:19:38,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 10:19:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-15 10:19:38,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:38,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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-15 10:19:38,974 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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-15 10:19:38,974 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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-15 10:19:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,976 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 10:19:38,976 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 10:19:38,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:38,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:38,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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 35 states. [2022-04-15 10:19:38,977 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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 35 states. [2022-04-15 10:19:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:38,978 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 10:19:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-15 10:19:38,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:38,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:38,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:38,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 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-15 10:19:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 10:19:38,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-15 10:19:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:38,981 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 10:19:38,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-15 10:19:38,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 10:19:39,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 10:19:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 10:19:39,007 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:39,007 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, 1] [2022-04-15 10:19:39,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:39,223 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-15 10:19:39,224 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:39,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-15 10:19:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [183768296] [2022-04-15 10:19:39,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:39,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-15 10:19:39,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:39,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095560073] [2022-04-15 10:19:39,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:39,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:39,241 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:39,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1759415154] [2022-04-15 10:19:39,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:19:39,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:39,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:39,242 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:39,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 10:19:39,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:19:39,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:39,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 10:19:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:39,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:39,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-15 10:19:39,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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);~counter~0 := 0; {790#true} is VALID [2022-04-15 10:19:39,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:39,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-15 10:19:39,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-15 10:19:39,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#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; {790#true} is VALID [2022-04-15 10:19:39,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:39,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-15 10:19:39,446 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-15 10:19:39,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:39,446 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 10:19:39,447 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-15 10:19:39,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-15 10:19:39,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 5);havoc #t~post6; {790#true} is VALID [2022-04-15 10:19:39,447 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:39,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:19:39,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:19:39,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:19:39,449 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-15 10:19:39,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-15 10:19:39,449 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* 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)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:19:39,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:19:39,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-15 10:19:39,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-15 10:19:39,451 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-15 10:19:39,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:19:47,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-15 10:19:47,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-15 10:19:47,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 10:19:47,760 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* 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)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 10:19:47,760 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-15 10:19:47,761 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-15 10:19:47,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:19:47,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 10:19:47,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 10:19:47,763 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:47,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 5);havoc #t~post6; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:47,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-15 10:19:47,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-15 10:19:47,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-15 10:19:47,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#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; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-15 10:19:47,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#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);~counter~0 := 0; {790#true} is VALID [2022-04-15 10:19:47,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-15 10:19:47,766 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-15 10:19:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095560073] [2022-04-15 10:19:47,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759415154] [2022-04-15 10:19:47,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759415154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:19:47,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:19:47,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 10:19:47,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:47,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [183768296] [2022-04-15 10:19:47,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [183768296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:47,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:47,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:19:47,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073641591] [2022-04-15 10:19:47,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:47,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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 29 [2022-04-15 10:19:47,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:47,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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-15 10:19:47,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:47,785 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:19:47,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:19:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 10:19:47,786 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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-15 10:19:47,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:47,972 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 10:19:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:19:47,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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 29 [2022-04-15 10:19:47,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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-15 10:19:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 10:19:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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-15 10:19:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-15 10:19:47,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-15 10:19:48,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:48,005 INFO L225 Difference]: With dead ends: 39 [2022-04-15 10:19:48,005 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 10:19:48,006 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 10:19:48,006 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:48,006 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 10:19:48,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-15 10:19:48,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:48,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-15 10:19:48,021 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-15 10:19:48,021 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-15 10:19:48,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:48,022 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 10:19:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 10:19:48,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:48,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:48,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 34 states. [2022-04-15 10:19:48,023 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 34 states. [2022-04-15 10:19:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:48,025 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 10:19:48,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-15 10:19:48,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:48,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:48,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:48,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-15 10:19:48,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-15 10:19:48,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-15 10:19:48,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:48,029 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-15 10:19:48,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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-15 10:19:48,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-15 10:19:48,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-15 10:19:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 10:19:48,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:48,061 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:48,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:48,270 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:48,271 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:48,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:48,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-15 10:19:48,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:48,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1569539711] [2022-04-15 10:19:48,271 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-15 10:19:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:48,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002248444] [2022-04-15 10:19:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:48,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:48,288 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:48,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [204813042] [2022-04-15 10:19:48,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:19:48,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:48,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:48,293 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:48,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 10:19:48,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:19:48,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:48,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 10:19:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:48,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:48,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-15 10:19:48,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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);~counter~0 := 0; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= ~counter~0 0)} {1183#true} #67#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,457 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= ~counter~0 0)} call #t~ret7 := main(); {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= ~counter~0 0)} 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; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,457 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,460 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #59#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,460 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,462 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #61#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1191#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:48,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,463 INFO L272 TraceCheckUtils]: 19: Hoare triple {1240#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= ~counter~0 1)} ~cond := #in~cond; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(<= ~counter~0 1)} assume !(0 == ~cond); {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {1240#(<= ~counter~0 1)} assume true; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,465 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1240#(<= ~counter~0 1)} {1240#(<= ~counter~0 1)} #63#return; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {1240#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {1240#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1240#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:48,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {1240#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1268#(<= |main_#t~post6| 1)} is VALID [2022-04-15 10:19:48,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1184#false} is VALID [2022-04-15 10:19:48,466 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-15 10:19:48,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-15 10:19:48,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-15 10:19:48,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-15 10:19:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:19:48,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:19:48,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-15 10:19:48,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-15 10:19:48,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-15 10:19:48,624 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-15 10:19:48,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1184#false} is VALID [2022-04-15 10:19:48,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1296#(< |main_#t~post6| 5)} is VALID [2022-04-15 10:19:48,625 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1300#(< ~counter~0 5)} is VALID [2022-04-15 10:19:48,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(< ~counter~0 5)} assume !!(0 != ~y3~0); {1300#(< ~counter~0 5)} is VALID [2022-04-15 10:19:48,626 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1183#true} {1300#(< ~counter~0 5)} #63#return; {1300#(< ~counter~0 5)} is VALID [2022-04-15 10:19:48,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 10:19:48,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-15 10:19:48,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-15 10:19:48,626 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1183#true} is VALID [2022-04-15 10:19:48,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1300#(< ~counter~0 5)} is VALID [2022-04-15 10:19:48,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1300#(< ~counter~0 5)} is VALID [2022-04-15 10:19:48,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(< ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,630 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#true} {1328#(< ~counter~0 4)} #61#return; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 10:19:48,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-15 10:19:48,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-15 10:19:48,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {1328#(< ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1183#true} is VALID [2022-04-15 10:19:48,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1328#(< ~counter~0 4)} #59#return; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-15 10:19:48,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-15 10:19:48,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-15 10:19:48,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {1328#(< ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1183#true} is VALID [2022-04-15 10:19:48,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(< ~counter~0 4)} 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; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#(< ~counter~0 4)} call #t~ret7 := main(); {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#(< ~counter~0 4)} {1183#true} #67#return; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#(< ~counter~0 4)} assume true; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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);~counter~0 := 0; {1328#(< ~counter~0 4)} is VALID [2022-04-15 10:19:48,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-15 10:19:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:19:48,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:48,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002248444] [2022-04-15 10:19:48,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:48,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204813042] [2022-04-15 10:19:48,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204813042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:19:48,639 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:19:48,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 10:19:48,639 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:48,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1569539711] [2022-04-15 10:19:48,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1569539711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:48,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:48,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 10:19:48,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852645982] [2022-04-15 10:19:48,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-15 10:19:48,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:48,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:19:48,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:48,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 10:19:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 10:19:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:19:48,659 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:19:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:48,744 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-15 10:19:48,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 10:19:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-15 10:19:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:19:48,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 10:19:48,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:19:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-15 10:19:48,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-15 10:19:48,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:48,773 INFO L225 Difference]: With dead ends: 43 [2022-04-15 10:19:48,773 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 10:19:48,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 10:19:48,774 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:48,774 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 10:19:48,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 10:19:48,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:48,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:19:48,799 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:19:48,799 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:19:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:48,800 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 10:19:48,800 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 10:19:48,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:48,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:48,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 10:19:48,801 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-15 10:19:48,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:48,802 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-15 10:19:48,802 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 10:19:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:48,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:48,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 10:19:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-15 10:19:48,804 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-15 10:19:48,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:48,804 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-15 10:19:48,804 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 10:19:48,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-15 10:19:48,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-15 10:19:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 10:19:48,840 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:48,840 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:48,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 10:19:49,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:49,059 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:49,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:49,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-15 10:19:49,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:49,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1998239346] [2022-04-15 10:19:49,060 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:49,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-15 10:19:49,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:49,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125824687] [2022-04-15 10:19:49,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:49,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:49,074 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:49,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407673350] [2022-04-15 10:19:49,074 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:19:49,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:49,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:49,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:49,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 10:19:49,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:19:49,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:49,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 10:19:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:49,125 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:49,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-15 10:19:49,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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);~counter~0 := 0; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} #67#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} call #t~ret7 := main(); {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} 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; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,281 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #59#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,283 INFO L272 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,284 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #61#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1630#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:49,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {1679#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(<= ~counter~0 1)} ~cond := #in~cond; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {1679#(<= ~counter~0 1)} assume !(0 == ~cond); {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1679#(<= ~counter~0 1)} assume true; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,287 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1679#(<= ~counter~0 1)} {1679#(<= ~counter~0 1)} #63#return; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1679#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1679#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1679#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:49,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {1679#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {1707#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,288 INFO L272 TraceCheckUtils]: 28: Hoare triple {1707#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {1707#(<= ~counter~0 2)} ~cond := #in~cond; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {1707#(<= ~counter~0 2)} assume !(0 == ~cond); {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,289 INFO L290 TraceCheckUtils]: 31: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,290 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1707#(<= ~counter~0 2)} {1707#(<= ~counter~0 2)} #63#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {1707#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {1707#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1735#(<= |main_#t~post6| 2)} is VALID [2022-04-15 10:19:49,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {1735#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1623#false} is VALID [2022-04-15 10:19:49,292 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-15 10:19:49,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-15 10:19:49,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-15 10:19:49,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-15 10:19:49,292 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:19:49,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:19:49,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-15 10:19:49,471 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-15 10:19:49,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-15 10:19:49,471 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-15 10:19:49,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {1763#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1623#false} is VALID [2022-04-15 10:19:49,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {1767#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1763#(< |main_#t~post6| 5)} is VALID [2022-04-15 10:19:49,473 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1767#(< ~counter~0 5)} is VALID [2022-04-15 10:19:49,473 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(< ~counter~0 5)} assume !!(0 != ~y3~0); {1767#(< ~counter~0 5)} is VALID [2022-04-15 10:19:49,474 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1622#true} {1767#(< ~counter~0 5)} #63#return; {1767#(< ~counter~0 5)} is VALID [2022-04-15 10:19:49,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-15 10:19:49,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-15 10:19:49,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-15 10:19:49,474 INFO L272 TraceCheckUtils]: 28: Hoare triple {1767#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-15 10:19:49,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1767#(< ~counter~0 5)} is VALID [2022-04-15 10:19:49,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(< ~counter~0 5)} is VALID [2022-04-15 10:19:49,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {1795#(< ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1795#(< ~counter~0 4)} is VALID [2022-04-15 10:19:49,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {1795#(< ~counter~0 4)} assume !!(0 != ~y3~0); {1795#(< ~counter~0 4)} is VALID [2022-04-15 10:19:49,475 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1622#true} {1795#(< ~counter~0 4)} #63#return; {1795#(< ~counter~0 4)} is VALID [2022-04-15 10:19:49,476 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-15 10:19:49,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-15 10:19:49,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-15 10:19:49,476 INFO L272 TraceCheckUtils]: 19: Hoare triple {1795#(< ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-15 10:19:49,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1795#(< ~counter~0 4)} is VALID [2022-04-15 10:19:49,476 INFO L290 TraceCheckUtils]: 17: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< ~counter~0 4)} is VALID [2022-04-15 10:19:49,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {1707#(<= ~counter~0 2)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,477 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1622#true} {1707#(<= ~counter~0 2)} #61#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-15 10:19:49,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-15 10:19:49,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-15 10:19:49,477 INFO L272 TraceCheckUtils]: 11: Hoare triple {1707#(<= ~counter~0 2)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1622#true} is VALID [2022-04-15 10:19:49,478 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1622#true} {1707#(<= ~counter~0 2)} #59#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-15 10:19:49,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-15 10:19:49,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-15 10:19:49,478 INFO L272 TraceCheckUtils]: 6: Hoare triple {1707#(<= ~counter~0 2)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1622#true} is VALID [2022-04-15 10:19:49,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {1707#(<= ~counter~0 2)} 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; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {1707#(<= ~counter~0 2)} call #t~ret7 := main(); {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1707#(<= ~counter~0 2)} {1622#true} #67#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#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);~counter~0 := 0; {1707#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:49,479 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-15 10:19:49,480 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 10:19:49,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:49,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125824687] [2022-04-15 10:19:49,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:49,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407673350] [2022-04-15 10:19:49,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407673350] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:19:49,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:19:49,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-15 10:19:49,480 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:49,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1998239346] [2022-04-15 10:19:49,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1998239346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:49,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:49,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 10:19:49,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506272955] [2022-04-15 10:19:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:49,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 10:19:49,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:49,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:19:49,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:49,502 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 10:19:49,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:49,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 10:19:49,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 10:19:49,502 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:19:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:49,621 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 10:19:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 10:19:49,622 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 10:19:49,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:19:49,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 10:19:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:19:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-15 10:19:49,625 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-15 10:19:49,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:49,659 INFO L225 Difference]: With dead ends: 52 [2022-04-15 10:19:49,659 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 10:19:49,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 10:19:49,660 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:49,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:49,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 10:19:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 10:19:49,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:49,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:19:49,701 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:19:49,701 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:19:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:49,702 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 10:19:49,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 10:19:49,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:49,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:49,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-15 10:19:49,703 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-15 10:19:49,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:49,704 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 10:19:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 10:19:49,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:49,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:49,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:49,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 10:19:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-15 10:19:49,706 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-15 10:19:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:49,706 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-15 10:19:49,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 10:19:49,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-15 10:19:49,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:49,746 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 10:19:49,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 10:19:49,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:49,747 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:49,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:49,963 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:49,963 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-15 10:19:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254075187] [2022-04-15 10:19:49,964 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:49,964 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-15 10:19:49,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:49,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883552184] [2022-04-15 10:19:49,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:49,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:49,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:49,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [383481595] [2022-04-15 10:19:49,974 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 10:19:49,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:49,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:49,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:49,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 10:19:50,012 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 10:19:50,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:50,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 10:19:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:50,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:50,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {2172#true} call ULTIMATE.init(); {2172#true} is VALID [2022-04-15 10:19:50,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#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);~counter~0 := 0; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2180#(<= ~counter~0 0)} {2172#true} #67#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {2180#(<= ~counter~0 0)} call #t~ret7 := main(); {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {2180#(<= ~counter~0 0)} 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; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,284 INFO L272 TraceCheckUtils]: 6: Hoare triple {2180#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {2180#(<= ~counter~0 0)} ~cond := #in~cond; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,285 INFO L290 TraceCheckUtils]: 8: Hoare triple {2180#(<= ~counter~0 0)} assume !(0 == ~cond); {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,285 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2180#(<= ~counter~0 0)} {2180#(<= ~counter~0 0)} #59#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {2180#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {2180#(<= ~counter~0 0)} ~cond := #in~cond; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {2180#(<= ~counter~0 0)} assume !(0 == ~cond); {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,287 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2180#(<= ~counter~0 0)} {2180#(<= ~counter~0 0)} #61#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {2180#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2180#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:50,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {2180#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,288 INFO L272 TraceCheckUtils]: 19: Hoare triple {2229#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#(<= ~counter~0 1)} ~cond := #in~cond; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {2229#(<= ~counter~0 1)} assume !(0 == ~cond); {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {2229#(<= ~counter~0 1)} assume true; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,290 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2229#(<= ~counter~0 1)} {2229#(<= ~counter~0 1)} #63#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {2229#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {2257#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,291 INFO L272 TraceCheckUtils]: 28: Hoare triple {2257#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {2257#(<= ~counter~0 2)} ~cond := #in~cond; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {2257#(<= ~counter~0 2)} assume !(0 == ~cond); {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {2257#(<= ~counter~0 2)} assume true; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,293 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2257#(<= ~counter~0 2)} {2257#(<= ~counter~0 2)} #63#return; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {2257#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {2257#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {2257#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,294 INFO L272 TraceCheckUtils]: 37: Hoare triple {2285#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= ~counter~0 3)} ~cond := #in~cond; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {2285#(<= ~counter~0 3)} assume !(0 == ~cond); {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {2285#(<= ~counter~0 3)} assume true; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,296 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2285#(<= ~counter~0 3)} {2285#(<= ~counter~0 3)} #63#return; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,296 INFO L290 TraceCheckUtils]: 42: Hoare triple {2285#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {2285#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,297 INFO L290 TraceCheckUtils]: 44: Hoare triple {2285#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2313#(<= |main_#t~post6| 3)} is VALID [2022-04-15 10:19:50,297 INFO L290 TraceCheckUtils]: 45: Hoare triple {2313#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {2173#false} is VALID [2022-04-15 10:19:50,297 INFO L272 TraceCheckUtils]: 46: Hoare triple {2173#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2173#false} is VALID [2022-04-15 10:19:50,297 INFO L290 TraceCheckUtils]: 47: Hoare triple {2173#false} ~cond := #in~cond; {2173#false} is VALID [2022-04-15 10:19:50,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {2173#false} assume 0 == ~cond; {2173#false} is VALID [2022-04-15 10:19:50,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {2173#false} assume !false; {2173#false} is VALID [2022-04-15 10:19:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:19:50,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:19:50,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {2173#false} assume !false; {2173#false} is VALID [2022-04-15 10:19:50,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {2173#false} assume 0 == ~cond; {2173#false} is VALID [2022-04-15 10:19:50,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {2173#false} ~cond := #in~cond; {2173#false} is VALID [2022-04-15 10:19:50,512 INFO L272 TraceCheckUtils]: 46: Hoare triple {2173#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2173#false} is VALID [2022-04-15 10:19:50,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2173#false} is VALID [2022-04-15 10:19:50,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {2345#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2341#(< |main_#t~post6| 5)} is VALID [2022-04-15 10:19:50,512 INFO L290 TraceCheckUtils]: 43: Hoare triple {2345#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2345#(< ~counter~0 5)} is VALID [2022-04-15 10:19:50,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {2345#(< ~counter~0 5)} assume !!(0 != ~y3~0); {2345#(< ~counter~0 5)} is VALID [2022-04-15 10:19:50,513 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2172#true} {2345#(< ~counter~0 5)} #63#return; {2345#(< ~counter~0 5)} is VALID [2022-04-15 10:19:50,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-15 10:19:50,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-15 10:19:50,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-15 10:19:50,514 INFO L272 TraceCheckUtils]: 37: Hoare triple {2345#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-15 10:19:50,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {2345#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2345#(< ~counter~0 5)} is VALID [2022-04-15 10:19:50,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {2285#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2345#(< ~counter~0 5)} is VALID [2022-04-15 10:19:50,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {2285#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,515 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,515 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2172#true} {2285#(<= ~counter~0 3)} #63#return; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,515 INFO L290 TraceCheckUtils]: 31: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-15 10:19:50,515 INFO L290 TraceCheckUtils]: 30: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-15 10:19:50,515 INFO L290 TraceCheckUtils]: 29: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-15 10:19:50,515 INFO L272 TraceCheckUtils]: 28: Hoare triple {2285#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-15 10:19:50,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {2285#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {2257#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:50,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {2257#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {2257#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,517 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2172#true} {2257#(<= ~counter~0 2)} #63#return; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-15 10:19:50,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-15 10:19:50,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-15 10:19:50,517 INFO L272 TraceCheckUtils]: 19: Hoare triple {2257#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-15 10:19:50,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {2257#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {2229#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:50,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#(<= ~counter~0 1)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,519 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2172#true} {2229#(<= ~counter~0 1)} #61#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,519 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-15 10:19:50,519 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-15 10:19:50,519 INFO L290 TraceCheckUtils]: 12: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-15 10:19:50,519 INFO L272 TraceCheckUtils]: 11: Hoare triple {2229#(<= ~counter~0 1)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2172#true} is VALID [2022-04-15 10:19:50,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2172#true} {2229#(<= ~counter~0 1)} #59#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-15 10:19:50,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-15 10:19:50,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-15 10:19:50,521 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#(<= ~counter~0 1)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2172#true} is VALID [2022-04-15 10:19:50,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#(<= ~counter~0 1)} 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; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#(<= ~counter~0 1)} call #t~ret7 := main(); {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#(<= ~counter~0 1)} {2172#true} #67#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#(<= ~counter~0 1)} assume true; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#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);~counter~0 := 0; {2229#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:50,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {2172#true} call ULTIMATE.init(); {2172#true} is VALID [2022-04-15 10:19:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 10:19:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:50,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883552184] [2022-04-15 10:19:50,541 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:50,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383481595] [2022-04-15 10:19:50,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383481595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:19:50,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:19:50,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-15 10:19:50,542 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:50,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [254075187] [2022-04-15 10:19:50,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [254075187] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:50,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:50,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 10:19:50,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975688991] [2022-04-15 10:19:50,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:50,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-15 10:19:50,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:50,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:19:50,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:50,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 10:19:50,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:50,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 10:19:50,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 10:19:50,584 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:19:50,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:50,713 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-15 10:19:50,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 10:19:50,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-15 10:19:50,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:50,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:19:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 10:19:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:19:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-15 10:19:50,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-15 10:19:50,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:50,773 INFO L225 Difference]: With dead ends: 61 [2022-04-15 10:19:50,773 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 10:19:50,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:19:50,774 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:50,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 10:19:50,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 10:19:50,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:50,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:19:50,817 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:19:50,818 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:19:50,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:50,820 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 10:19:50,820 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 10:19:50,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:50,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:50,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-15 10:19:50,821 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-15 10:19:50,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:50,822 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-15 10:19:50,822 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 10:19:50,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:50,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:50,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:50,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-15 10:19:50,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-15 10:19:50,825 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-15 10:19:50,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:50,827 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-15 10:19:50,827 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-15 10:19:50,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-15 10:19:50,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 10:19:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 10:19:50,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:50,886 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:50,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:51,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:51,086 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:51,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-15 10:19:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542466343] [2022-04-15 10:19:51,087 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-15 10:19:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:51,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456833614] [2022-04-15 10:19:51,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:51,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:51,097 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:51,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064586116] [2022-04-15 10:19:51,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 10:19:51,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:51,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:51,099 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:51,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 10:19:51,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 10:19:51,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 10:19:51,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 10:19:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 10:19:51,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 10:19:51,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2022-04-15 10:19:51,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#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);~counter~0 := 0; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2840#(<= ~counter~0 0)} {2832#true} #67#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {2840#(<= ~counter~0 0)} call #t~ret7 := main(); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {2840#(<= ~counter~0 0)} 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; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {2840#(<= ~counter~0 0)} ~cond := #in~cond; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {2840#(<= ~counter~0 0)} assume !(0 == ~cond); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2840#(<= ~counter~0 0)} {2840#(<= ~counter~0 0)} #59#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {2840#(<= ~counter~0 0)} ~cond := #in~cond; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {2840#(<= ~counter~0 0)} assume !(0 == ~cond); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,396 INFO L290 TraceCheckUtils]: 14: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,397 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2840#(<= ~counter~0 0)} {2840#(<= ~counter~0 0)} #61#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {2840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,398 INFO L272 TraceCheckUtils]: 19: Hoare triple {2889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {2889#(<= ~counter~0 1)} ~cond := #in~cond; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,399 INFO L290 TraceCheckUtils]: 21: Hoare triple {2889#(<= ~counter~0 1)} assume !(0 == ~cond); {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,399 INFO L290 TraceCheckUtils]: 22: Hoare triple {2889#(<= ~counter~0 1)} assume true; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,400 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2889#(<= ~counter~0 1)} {2889#(<= ~counter~0 1)} #63#return; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,400 INFO L290 TraceCheckUtils]: 24: Hoare triple {2889#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {2889#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,401 INFO L290 TraceCheckUtils]: 26: Hoare triple {2889#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,401 INFO L290 TraceCheckUtils]: 27: Hoare triple {2917#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,402 INFO L272 TraceCheckUtils]: 28: Hoare triple {2917#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {2917#(<= ~counter~0 2)} ~cond := #in~cond; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,402 INFO L290 TraceCheckUtils]: 30: Hoare triple {2917#(<= ~counter~0 2)} assume !(0 == ~cond); {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,403 INFO L290 TraceCheckUtils]: 31: Hoare triple {2917#(<= ~counter~0 2)} assume true; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,403 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2917#(<= ~counter~0 2)} {2917#(<= ~counter~0 2)} #63#return; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {2917#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,404 INFO L290 TraceCheckUtils]: 34: Hoare triple {2917#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,404 INFO L290 TraceCheckUtils]: 35: Hoare triple {2917#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {2945#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,405 INFO L272 TraceCheckUtils]: 37: Hoare triple {2945#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {2945#(<= ~counter~0 3)} ~cond := #in~cond; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {2945#(<= ~counter~0 3)} assume !(0 == ~cond); {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {2945#(<= ~counter~0 3)} assume true; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,407 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2945#(<= ~counter~0 3)} {2945#(<= ~counter~0 3)} #63#return; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {2945#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {2945#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {2945#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {2973#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,409 INFO L272 TraceCheckUtils]: 46: Hoare triple {2973#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,409 INFO L290 TraceCheckUtils]: 47: Hoare triple {2973#(<= ~counter~0 4)} ~cond := #in~cond; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,410 INFO L290 TraceCheckUtils]: 48: Hoare triple {2973#(<= ~counter~0 4)} assume !(0 == ~cond); {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,410 INFO L290 TraceCheckUtils]: 49: Hoare triple {2973#(<= ~counter~0 4)} assume true; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,410 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2973#(<= ~counter~0 4)} {2973#(<= ~counter~0 4)} #63#return; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,411 INFO L290 TraceCheckUtils]: 51: Hoare triple {2973#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,411 INFO L290 TraceCheckUtils]: 52: Hoare triple {2973#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,411 INFO L290 TraceCheckUtils]: 53: Hoare triple {2973#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3001#(<= |main_#t~post6| 4)} is VALID [2022-04-15 10:19:51,412 INFO L290 TraceCheckUtils]: 54: Hoare triple {3001#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2833#false} is VALID [2022-04-15 10:19:51,412 INFO L272 TraceCheckUtils]: 55: Hoare triple {2833#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2833#false} is VALID [2022-04-15 10:19:51,412 INFO L290 TraceCheckUtils]: 56: Hoare triple {2833#false} ~cond := #in~cond; {2833#false} is VALID [2022-04-15 10:19:51,412 INFO L290 TraceCheckUtils]: 57: Hoare triple {2833#false} assume 0 == ~cond; {2833#false} is VALID [2022-04-15 10:19:51,412 INFO L290 TraceCheckUtils]: 58: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2022-04-15 10:19:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 10:19:51,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 10:19:51,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2022-04-15 10:19:51,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {2833#false} assume 0 == ~cond; {2833#false} is VALID [2022-04-15 10:19:51,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {2833#false} ~cond := #in~cond; {2833#false} is VALID [2022-04-15 10:19:51,660 INFO L272 TraceCheckUtils]: 55: Hoare triple {2833#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2833#false} is VALID [2022-04-15 10:19:51,661 INFO L290 TraceCheckUtils]: 54: Hoare triple {3001#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2833#false} is VALID [2022-04-15 10:19:51,661 INFO L290 TraceCheckUtils]: 53: Hoare triple {2973#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3001#(<= |main_#t~post6| 4)} is VALID [2022-04-15 10:19:51,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {2973#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,661 INFO L290 TraceCheckUtils]: 51: Hoare triple {2973#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,662 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2832#true} {2973#(<= ~counter~0 4)} #63#return; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,662 INFO L290 TraceCheckUtils]: 48: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,662 INFO L290 TraceCheckUtils]: 47: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,662 INFO L272 TraceCheckUtils]: 46: Hoare triple {2973#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {2973#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {2945#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-15 10:19:51,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {2945#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {2945#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,664 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2832#true} {2945#(<= ~counter~0 3)} #63#return; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,664 INFO L290 TraceCheckUtils]: 38: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,664 INFO L272 TraceCheckUtils]: 37: Hoare triple {2945#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,664 INFO L290 TraceCheckUtils]: 36: Hoare triple {2945#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,665 INFO L290 TraceCheckUtils]: 35: Hoare triple {2917#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-15 10:19:51,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {2917#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {2917#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,667 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2832#true} {2917#(<= ~counter~0 2)} #63#return; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,667 INFO L272 TraceCheckUtils]: 28: Hoare triple {2917#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {2917#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {2889#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-15 10:19:51,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {2889#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {2889#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,668 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2832#true} {2889#(<= ~counter~0 1)} #63#return; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,669 INFO L272 TraceCheckUtils]: 19: Hoare triple {2889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {2840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-15 10:19:51,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2832#true} {2840#(<= ~counter~0 0)} #61#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2832#true} {2840#(<= ~counter~0 0)} #59#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-15 10:19:51,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-15 10:19:51,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-15 10:19:51,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2832#true} is VALID [2022-04-15 10:19:51,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {2840#(<= ~counter~0 0)} 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; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {2840#(<= ~counter~0 0)} call #t~ret7 := main(); {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2840#(<= ~counter~0 0)} {2832#true} #67#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#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);~counter~0 := 0; {2840#(<= ~counter~0 0)} is VALID [2022-04-15 10:19:51,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2022-04-15 10:19:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 10:19:51,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 10:19:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456833614] [2022-04-15 10:19:51,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 10:19:51,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064586116] [2022-04-15 10:19:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064586116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 10:19:51,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 10:19:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-15 10:19:51,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 10:19:51,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542466343] [2022-04-15 10:19:51,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542466343] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 10:19:51,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 10:19:51,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 10:19:51,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920388974] [2022-04-15 10:19:51,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 10:19:51,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 10:19:51,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 10:19:51,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:19:51,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:51,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 10:19:51,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:51,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 10:19:51,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 10:19:51,706 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:19:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:51,899 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-15 10:19:51,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 10:19:51,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-15 10:19:51,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 10:19:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:19:51,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 10:19:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:19:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-15 10:19:51,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-15 10:19:51,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:51,948 INFO L225 Difference]: With dead ends: 70 [2022-04-15 10:19:51,948 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 10:19:51,948 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 10:19:51,948 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 10:19:51,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 96 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 10:19:51,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 10:19:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 10:19:52,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 10:19:52,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:19:52,014 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:19:52,014 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:19:52,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:52,015 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 10:19:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 10:19:52,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:52,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:52,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 10:19:52,016 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-15 10:19:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 10:19:52,017 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-15 10:19:52,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 10:19:52,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 10:19:52,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 10:19:52,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 10:19:52,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 10:19:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 10:19:52,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-15 10:19:52,019 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-15 10:19:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 10:19:52,019 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-15 10:19:52,019 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-15 10:19:52,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-15 10:19:52,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 10:19:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-15 10:19:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 10:19:52,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 10:19:52,083 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 10:19:52,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 10:19:52,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:52,283 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 10:19:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 10:19:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-15 10:19:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 10:19:52,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416499271] [2022-04-15 10:19:52,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 10:19:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-15 10:19:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 10:19:52,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561648922] [2022-04-15 10:19:52,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 10:19:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 10:19:52,298 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 10:19:52,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [889048847] [2022-04-15 10:19:52,298 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 10:19:52,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 10:19:52,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 10:19:52,299 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 10:19:52,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 10:19:52,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 10:19:52,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 10:19:52,341 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 10:19:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 10:19:52,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 10:19:52,383 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 10:19:52,383 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 10:19:52,385 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 10:19:52,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-15 10:19:52,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-15 10:19:52,603 INFO L719 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 2] [2022-04-15 10:19:52,605 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-15 10:19:52,615 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 10:19:52,616 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 10:19:52,616 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 10:19:52,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 10:19:52 BoogieIcfgContainer [2022-04-15 10:19:52,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 10:19:52,618 INFO L158 Benchmark]: Toolchain (without parser) took 15757.74ms. Allocated memory was 197.1MB in the beginning and 250.6MB in the end (delta: 53.5MB). Free memory was 147.5MB in the beginning and 172.6MB in the end (delta: -25.0MB). Peak memory consumption was 29.0MB. Max. memory is 8.0GB. [2022-04-15 10:19:52,618 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 10:19:52,618 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.67ms. Allocated memory is still 197.1MB. Free memory was 147.4MB in the beginning and 172.4MB in the end (delta: -25.0MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-15 10:19:52,618 INFO L158 Benchmark]: Boogie Preprocessor took 17.23ms. Allocated memory is still 197.1MB. Free memory was 172.4MB in the beginning and 171.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 10:19:52,618 INFO L158 Benchmark]: RCFGBuilder took 211.28ms. Allocated memory is still 197.1MB. Free memory was 171.0MB in the beginning and 159.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 10:19:52,619 INFO L158 Benchmark]: TraceAbstraction took 15317.23ms. Allocated memory was 197.1MB in the beginning and 250.6MB in the end (delta: 53.5MB). Free memory was 159.4MB in the beginning and 172.6MB in the end (delta: -13.1MB). Peak memory consumption was 41.2MB. Max. memory is 8.0GB. [2022-04-15 10:19:52,619 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 197.1MB. Free memory is still 163.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.67ms. Allocated memory is still 197.1MB. Free memory was 147.4MB in the beginning and 172.4MB in the end (delta: -25.0MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.23ms. Allocated memory is still 197.1MB. Free memory was 172.4MB in the beginning and 171.0MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 211.28ms. Allocated memory is still 197.1MB. Free memory was 171.0MB in the beginning and 159.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 15317.23ms. Allocated memory was 197.1MB in the beginning and 250.6MB in the end (delta: 53.5MB). Free memory was 159.4MB in the beginning and 172.6MB in the end (delta: -13.1MB). Peak memory consumption was 41.2MB. 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 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) [L30] CALL assume_abort_if_not(x2 != 0) [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND FALSE !(counter++<5) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 642 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 216 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 427 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-15 10:19:52,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...