/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/sqrt1-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:36:35,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:36:35,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:36:35,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:36:35,184 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:36:35,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:36:35,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:36:35,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:36:35,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:36:35,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:36:35,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:36:35,197 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:36:35,197 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:36:35,199 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:36:35,200 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:36:35,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:36:35,202 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:36:35,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:36:35,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:36:35,209 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:36:35,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:36:35,211 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:36:35,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:36:35,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:36:35,213 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:36:35,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:36:35,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:36:35,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:36:35,219 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:36:35,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:36:35,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:36:35,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:36:35,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:36:35,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:36:35,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:36:35,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:36:35,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:36:35,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:36:35,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:36:35,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:36:35,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:36:35,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:36:35,226 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:36:35,234 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:36:35,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:36:35,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:36:35,235 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:36:35,236 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:36:35,236 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:36:35,236 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:36:35,236 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:36:35,236 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:36:35,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:36:35,237 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:36:35,237 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 04:36:35,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:36:35,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:36:35,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:36:35,459 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:36:35,460 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:36:35,461 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/sqrt1-ll.c [2022-04-08 04:36:35,508 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a6fec91/90ee993ed3a540f5ae9f87a34017c6c7/FLAG0da273b02 [2022-04-08 04:36:35,857 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:36:35,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/sqrt1-ll.c [2022-04-08 04:36:35,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a6fec91/90ee993ed3a540f5ae9f87a34017c6c7/FLAG0da273b02 [2022-04-08 04:36:36,324 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a6fec91/90ee993ed3a540f5ae9f87a34017c6c7 [2022-04-08 04:36:36,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:36:36,327 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:36:36,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:36:36,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:36:36,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:36:36,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d778924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36, skipping insertion in model container [2022-04-08 04:36:36,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,339 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:36:36,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:36:36,476 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/sqrt1-ll.c[520,533] [2022-04-08 04:36:36,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:36:36,507 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:36:36,515 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/sqrt1-ll.c[520,533] [2022-04-08 04:36:36,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:36:36,531 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:36:36,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36 WrapperNode [2022-04-08 04:36:36,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:36:36,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:36:36,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:36:36,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:36:36,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,545 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:36:36,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:36:36,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:36:36,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:36:36,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (1/1) ... [2022-04-08 04:36:36,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:36:36,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:36,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 04:36:36,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:36:36,618 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:36:36,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:36:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:36:36,623 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:36:36,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:36:36,667 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:36:36,668 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:36:36,838 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:36:36,846 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:36:36,847 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 04:36:36,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:36:36 BoogieIcfgContainer [2022-04-08 04:36:36,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:36:36,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:36:36,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:36:36,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:36:36,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:36:36" (1/3) ... [2022-04-08 04:36:36,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c78bbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:36:36, skipping insertion in model container [2022-04-08 04:36:36,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:36:36" (2/3) ... [2022-04-08 04:36:36,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c78bbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:36:36, skipping insertion in model container [2022-04-08 04:36:36,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:36:36" (3/3) ... [2022-04-08 04:36:36,876 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt1-ll.c [2022-04-08 04:36:36,879 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:36:36,879 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:36:36,933 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:36:36,938 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 04:36:36,938 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:36:36,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 04:36:36,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:36:36,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:36,980 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:36,981 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:36,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash 515438393, now seen corresponding path program 1 times [2022-04-08 04:36:36,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:36,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [379071605] [2022-04-08 04:36:37,003 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:36:37,003 INFO L85 PathProgramCache]: Analyzing trace with hash 515438393, now seen corresponding path program 2 times [2022-04-08 04:36:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:37,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280301804] [2022-04-08 04:36:37,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:37,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:36:37,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:37,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 04:36:37,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:36:37,181 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2022-04-08 04:36:37,182 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:36:37,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-04-08 04:36:37,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-08 04:36:37,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #65#return; {28#true} is VALID [2022-04-08 04:36:37,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret5 := main(); {28#true} is VALID [2022-04-08 04:36:37,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {28#true} is VALID [2022-04-08 04:36:37,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume false; {29#false} is VALID [2022-04-08 04:36:37,185 INFO L272 TraceCheckUtils]: 7: Hoare triple {29#false} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {29#false} is VALID [2022-04-08 04:36:37,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-08 04:36:37,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-08 04:36:37,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-08 04:36:37,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:36:37,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:37,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280301804] [2022-04-08 04:36:37,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280301804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:37,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:37,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:36:37,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:37,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [379071605] [2022-04-08 04:36:37,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [379071605] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:37,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:37,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:36:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974385145] [2022-04-08 04:36:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:37,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:36:37,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:37,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:37,220 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:36:37,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:37,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:36:37,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:36:37,245 INFO L87 Difference]: Start difference. First operand has 25 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:37,383 INFO L93 Difference]: Finished difference Result 44 states and 66 transitions. [2022-04-08 04:36:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:36:37,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:36:37,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 04:36:37,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-08 04:36:37,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-08 04:36:37,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:37,483 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:36:37,484 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 04:36:37,486 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:36:37,488 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:37,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:36:37,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 04:36:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-08 04:36:37,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:37,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:36:37,509 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:36:37,510 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:36:37,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:37,513 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 04:36:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 04:36:37,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:37,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:37,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 20 states. [2022-04-08 04:36:37,514 INFO L87 Difference]: Start difference. First operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 20 states. [2022-04-08 04:36:37,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:37,516 INFO L93 Difference]: Finished difference Result 20 states and 25 transitions. [2022-04-08 04:36:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 04:36:37,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:37,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:37,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:37,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 04:36:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-04-08 04:36:37,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 11 [2022-04-08 04:36:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:37,521 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-04-08 04:36:37,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 25 transitions. [2022-04-08 04:36:37,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-04-08 04:36:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 04:36:37,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:37,550 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:37,550 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:36:37,550 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 517106689, now seen corresponding path program 1 times [2022-04-08 04:36:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:37,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922600941] [2022-04-08 04:36:37,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:36:37,556 INFO L85 PathProgramCache]: Analyzing trace with hash 517106689, now seen corresponding path program 2 times [2022-04-08 04:36:37,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:37,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648717211] [2022-04-08 04:36:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:37,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:36:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:37,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-08 04:36:37,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-08 04:36:37,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #65#return; {204#true} is VALID [2022-04-08 04:36:37,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:36:37,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {204#true} is VALID [2022-04-08 04:36:37,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#true} assume true; {204#true} is VALID [2022-04-08 04:36:37,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204#true} {204#true} #65#return; {204#true} is VALID [2022-04-08 04:36:37,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {204#true} call #t~ret5 := main(); {204#true} is VALID [2022-04-08 04:36:37,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {204#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {209#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 04:36:37,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {209#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} assume !false; {209#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} is VALID [2022-04-08 04:36:37,664 INFO L272 TraceCheckUtils]: 7: Hoare triple {209#(and (= (* main_~a~0 2) 0) (= main_~t~0 (+ (* main_~a~0 2) 1)))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {210#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 04:36:37,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {210#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {211#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 04:36:37,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {211#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {205#false} is VALID [2022-04-08 04:36:37,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {205#false} assume !false; {205#false} is VALID [2022-04-08 04:36:37,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:36:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648717211] [2022-04-08 04:36:37,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648717211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:37,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:37,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:36:37,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922600941] [2022-04-08 04:36:37,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922600941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:36:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747890172] [2022-04-08 04:36:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:37,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:36:37,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:37,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:37,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:37,677 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:36:37,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:36:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:36:37,678 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:38,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,029 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-04-08 04:36:38,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 04:36:38,029 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 04:36:38,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:38,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 04:36:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-04-08 04:36:38,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-04-08 04:36:38,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:38,085 INFO L225 Difference]: With dead ends: 34 [2022-04-08 04:36:38,085 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:36:38,086 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 04:36:38,089 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 21 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:38,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 34 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:36:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:36:38,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-04-08 04:36:38,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:38,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:36:38,109 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:36:38,110 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:36:38,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,116 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 04:36:38,116 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 04:36:38,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-08 04:36:38,119 INFO L87 Difference]: Start difference. First operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 32 states. [2022-04-08 04:36:38,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,122 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-04-08 04:36:38,122 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-08 04:36:38,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:38,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:38,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 04:36:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 04:36:38,125 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 11 [2022-04-08 04:36:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:38,125 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 04:36:38,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:36:38,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-08 04:36:38,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:38,170 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 04:36:38,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:36:38,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:38,171 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:38,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:36:38,171 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:38,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:38,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1248765655, now seen corresponding path program 1 times [2022-04-08 04:36:38,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:38,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [329588942] [2022-04-08 04:36:38,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:36:38,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1248765655, now seen corresponding path program 2 times [2022-04-08 04:36:38,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:38,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958019774] [2022-04-08 04:36:38,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:38,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:38,186 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:38,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [568033931] [2022-04-08 04:36:38,187 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:36:38,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:38,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:38,207 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:36:38,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 04:36:38,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:36:38,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:36:38,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:36:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:38,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:36:38,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2022-04-08 04:36:38,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {415#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); {415#true} is VALID [2022-04-08 04:36:38,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2022-04-08 04:36:38,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #65#return; {415#true} is VALID [2022-04-08 04:36:38,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret5 := main(); {415#true} is VALID [2022-04-08 04:36:38,403 INFO L290 TraceCheckUtils]: 5: Hoare triple {415#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {435#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 04:36:38,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {435#(and (= main_~a~0 0) (= main_~s~0 1))} assume !false; {435#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 04:36:38,404 INFO L272 TraceCheckUtils]: 7: Hoare triple {435#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {415#true} is VALID [2022-04-08 04:36:38,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {415#true} ~cond := #in~cond; {415#true} is VALID [2022-04-08 04:36:38,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {415#true} assume !(0 == ~cond); {415#true} is VALID [2022-04-08 04:36:38,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#true} assume true; {415#true} is VALID [2022-04-08 04:36:38,406 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {415#true} {435#(and (= main_~a~0 0) (= main_~s~0 1))} #53#return; {435#(and (= main_~a~0 0) (= main_~s~0 1))} is VALID [2022-04-08 04:36:38,407 INFO L272 TraceCheckUtils]: 12: Hoare triple {435#(and (= main_~a~0 0) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {457#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:36:38,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {461#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:36:38,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {461#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {416#false} is VALID [2022-04-08 04:36:38,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#false} assume !false; {416#false} is VALID [2022-04-08 04:36:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:36:38,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:36:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958019774] [2022-04-08 04:36:38,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:38,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568033931] [2022-04-08 04:36:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568033931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:38,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:36:38,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:38,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [329588942] [2022-04-08 04:36:38,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [329588942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:38,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:38,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:36:38,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810126279] [2022-04-08 04:36:38,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:38,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 04:36:38,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:38,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:36:38,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:38,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:36:38,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:38,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:36:38,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:36:38,428 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:36:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,574 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-08 04:36:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:36:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-08 04:36:38,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:38,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:36:38,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 04:36:38,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:36:38,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 04:36:38,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-08 04:36:38,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:38,638 INFO L225 Difference]: With dead ends: 38 [2022-04-08 04:36:38,638 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 04:36:38,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:36:38,639 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:38,639 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:36:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 04:36:38,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-08 04:36:38,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:38,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:36:38,650 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:36:38,650 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:36:38,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,652 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 04:36:38,652 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 04:36:38,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 36 states. [2022-04-08 04:36:38,653 INFO L87 Difference]: Start difference. First operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 36 states. [2022-04-08 04:36:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:38,655 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-04-08 04:36:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-08 04:36:38,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:38,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:38,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:38,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:38,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 04:36:38,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-08 04:36:38,658 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 16 [2022-04-08 04:36:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:38,658 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-08 04:36:38,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:36:38,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-08 04:36:38,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-08 04:36:38,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:36:38,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:38,702 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:38,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-08 04:36:38,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:38,916 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:38,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:38,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064513, now seen corresponding path program 1 times [2022-04-08 04:36:38,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1934650513] [2022-04-08 04:36:38,917 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:36:38,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1451064513, now seen corresponding path program 2 times [2022-04-08 04:36:38,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:36:38,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009894531] [2022-04-08 04:36:38,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:36:38,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:36:38,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:36:38,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [155182688] [2022-04-08 04:36:38,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 04:36:38,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:36:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:36:38,933 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 04:36:38,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 04:36:38,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 04:36:38,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 04:36:38,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 04:36:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:36:38,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:36:39,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {687#true} is VALID [2022-04-08 04:36:39,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#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); {687#true} is VALID [2022-04-08 04:36:39,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-08 04:36:39,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #65#return; {687#true} is VALID [2022-04-08 04:36:39,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret5 := main(); {687#true} is VALID [2022-04-08 04:36:39,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {707#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 04:36:39,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {707#(and (= main_~t~0 1) (= main_~s~0 1))} assume !false; {707#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 04:36:39,109 INFO L272 TraceCheckUtils]: 7: Hoare triple {707#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {687#true} is VALID [2022-04-08 04:36:39,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {687#true} ~cond := #in~cond; {687#true} is VALID [2022-04-08 04:36:39,109 INFO L290 TraceCheckUtils]: 9: Hoare triple {687#true} assume !(0 == ~cond); {687#true} is VALID [2022-04-08 04:36:39,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-08 04:36:39,110 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {687#true} {707#(and (= main_~t~0 1) (= main_~s~0 1))} #53#return; {707#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 04:36:39,110 INFO L272 TraceCheckUtils]: 12: Hoare triple {707#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if ~s~0 == (1 + ~a~0) * (1 + ~a~0) then 1 else 0)); {687#true} is VALID [2022-04-08 04:36:39,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {687#true} ~cond := #in~cond; {687#true} is VALID [2022-04-08 04:36:39,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {687#true} assume !(0 == ~cond); {687#true} is VALID [2022-04-08 04:36:39,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-08 04:36:39,111 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {687#true} {707#(and (= main_~t~0 1) (= main_~s~0 1))} #55#return; {707#(and (= main_~t~0 1) (= main_~s~0 1))} is VALID [2022-04-08 04:36:39,112 INFO L272 TraceCheckUtils]: 17: Hoare triple {707#(and (= main_~t~0 1) (= main_~s~0 1))} call __VERIFIER_assert((if 0 == 1 + (~t~0 * ~t~0 - 4 * ~s~0 + 2 * ~t~0) then 1 else 0)); {744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:36:39,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {744#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:36:39,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {748#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {688#false} is VALID [2022-04-08 04:36:39,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-08 04:36:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 04:36:39,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:36:39,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:36:39,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009894531] [2022-04-08 04:36:39,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:36:39,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155182688] [2022-04-08 04:36:39,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155182688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:39,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:39,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:36:39,114 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:36:39,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1934650513] [2022-04-08 04:36:39,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1934650513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:36:39,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:36:39,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:36:39,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690250351] [2022-04-08 04:36:39,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:36:39,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-08 04:36:39,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:36:39,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:36:39,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:39,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:36:39,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:39,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:36:39,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:36:39,134 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:36:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:39,305 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-08 04:36:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:36:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-08 04:36:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:36:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:36:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 04:36:39,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:36:39,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 04:36:39,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-08 04:36:39,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:39,352 INFO L225 Difference]: With dead ends: 42 [2022-04-08 04:36:39,352 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 04:36:39,353 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:36:39,358 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:36:39,359 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:36:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 04:36:39,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-08 04:36:39,382 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:36:39,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:36:39,383 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:36:39,383 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:36:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:39,387 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 04:36:39,387 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-08 04:36:39,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:39,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:39,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-08 04:36:39,390 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-08 04:36:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:36:39,400 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-08 04:36:39,400 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-08 04:36:39,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:36:39,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:36:39,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:36:39,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:36:39,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 04:36:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-08 04:36:39,405 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 21 [2022-04-08 04:36:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:36:39,406 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-08 04:36:39,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 04:36:39,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2022-04-08 04:36:39,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:36:39,445 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-08 04:36:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 04:36:39,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:36:39,446 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:36:39,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 04:36:39,659 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,SelfDestructingSolverStorable3 [2022-04-08 04:36:39,659 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:36:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:36:39,660 INFO L85 PathProgramCache]: Analyzing trace with hash 412610311, now seen corresponding path program 1 times [2022-04-08 04:36:39,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:36:39,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1265983483] [2022-04-08 04:37:03,142 WARN L232 SmtUtils]: Spent 22.90s on a formula simplification. DAG size of input: 118 DAG size of output: 111 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-08 04:37:03,170 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 3=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:37:03,174 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 04:37:03,186 INFO L85 PathProgramCache]: Analyzing trace with hash 296996863, now seen corresponding path program 1 times [2022-04-08 04:37:03,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:37:03,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284759994] [2022-04-08 04:37:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:37:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:37:03,195 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 04:37:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127460032] [2022-04-08 04:37:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:37:03,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:37:03,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:37:03,197 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-08 04:37:03,198 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-08 04:37:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:37:03,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 04:37:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:37:03,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 04:37:13,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {988#true} call ULTIMATE.init(); {988#true} is VALID [2022-04-08 04:37:13,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#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); {988#true} is VALID [2022-04-08 04:37:13,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {988#true} assume true; {988#true} is VALID [2022-04-08 04:37:13,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {988#true} {988#true} #65#return; {988#true} is VALID [2022-04-08 04:37:13,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {988#true} call #t~ret5 := main(); {988#true} is VALID [2022-04-08 04:37:13,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {988#true} havoc ~n~0;havoc ~a~0;havoc ~s~0;havoc ~t~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~n~0 := #t~nondet4;havoc #t~nondet4;~a~0 := 0;~s~0 := 1;~t~0 := 1; {1008#(and (= main_~a~0 0) (= main_~t~0 1))} is VALID [2022-04-08 04:37:13,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(and (= main_~a~0 0) (= main_~t~0 1))} [69] L29-2-->L30_primed: Formula: (let ((.cse4 (* 2 v_main_~a~0_19))) (let ((.cse2 (= v_main_~a~0_19 v_main_~a~0_18)) (.cse3 (= v_main_~t~0_19 v_main_~t~0_18)) (.cse0 (<= v_main_~s~0_20 v_main_~n~0_6)) (.cse1 (= v_main_~t~0_19 (+ .cse4 1)))) (or (and (or (not .cse0) (not .cse1) (not (= (* v_main_~s~0_20 4) (+ (* v_main_~t~0_19 v_main_~t~0_19) (* v_main_~t~0_19 2) 1)))) .cse2 .cse3 (= v_main_~s~0_19 v_main_~s~0_20)) (and (= v_main_~n~0_6 v_main_~n~0_6) (= v_main_~s~0_20 v_main_~s~0_19) .cse2 .cse3) (let ((.cse7 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (and (= (+ (* v_main_~a~0_19 v_main_~a~0_19) .cse4 1) v_main_~s~0_20) .cse0 (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~t~0_18) v_main_~t~0_19 2) (- 4)))) (not (<= 1 v_itHalf_1)) (let ((.cse5 (* (* v_main_~t~0_19 v_itHalf_1) 2)) (.cse6 (* v_itHalf_1 2))) (and (= (+ v_main_~s~0_20 .cse5) (+ (* (* v_itHalf_1 v_main_~a~0_19) 4) (* v_main_~a~0_19 v_main_~a~0_19) (* 2 v_main_~a~0_19) .cse6 1)) (<= (+ v_main_~s~0_20 .cse5 .cse6 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6))))) (= (mod (+ v_main_~t~0_19 (* v_main_~t~0_18 3) 2) 4) 0) (= (+ (* .cse7 2) 1 v_main_~a~0_19) v_main_~a~0_18) (<= 0 .cse7) .cse1 (= v_main_~s~0_19 (+ v_main_~s~0_20 v_main_~t~0_19 (* (* v_main_~t~0_19 .cse7) 2) 2 (* (* .cse7 .cse7) 4) (* .cse7 6))))) (let ((.cse8 (div (+ (* (- 1) v_main_~a~0_19) v_main_~a~0_18) 2))) (and (= (mod (+ v_main_~a~0_19 v_main_~a~0_18) 2) 0) .cse0 (= v_main_~s~0_19 (+ v_main_~s~0_20 (* .cse8 2) (* 2 (* v_main_~t~0_19 .cse8)) (* (* .cse8 .cse8) 4))) (< 0 .cse8) (= v_main_~t~0_18 (+ v_main_~t~0_19 (* .cse8 4))) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~a~0_19) v_main_~a~0_18) 2))) (not (<= 0 v_itHalf_1)) (let ((.cse9 (* (* v_main_~t~0_19 v_itHalf_1) 2))) (and (<= (+ v_main_~s~0_20 v_main_~t~0_19 2 (* v_itHalf_1 6) .cse9 (* (* v_itHalf_1 v_itHalf_1) 4)) v_main_~n~0_6) (= (+ v_main_~s~0_20 v_main_~t~0_19 .cse9) (+ (* 4 v_main_~a~0_19) (* (* v_itHalf_1 v_main_~a~0_19) 4) 2 (* v_main_~a~0_19 v_main_~a~0_19) (* v_itHalf_1 2))))))) .cse1))))) InVars {main_~t~0=v_main_~t~0_19, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_20, main_~a~0=v_main_~a~0_19} OutVars{main_~t~0=v_main_~t~0_18, main_~n~0=v_main_~n~0_6, main_~s~0=v_main_~s~0_19, main_~a~0=v_main_~a~0_18} AuxVars[] AssignedVars[main_~t~0, main_~s~0, main_~a~0] {1012#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))))} is VALID [2022-04-08 04:37:13,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1012#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))))} [68] L30_primed-->L30: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1012#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))))} is VALID [2022-04-08 04:37:13,975 INFO L272 TraceCheckUtils]: 8: Hoare triple {1012#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0)))))))} call __VERIFIER_assert((if ~t~0 == 1 + 2 * ~a~0 then 1 else 0)); {1019#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 04:37:13,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {1019#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1023#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 04:37:13,976 INFO L290 TraceCheckUtils]: 10: Hoare triple {1023#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {989#false} is VALID [2022-04-08 04:37:13,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {989#false} assume !false; {989#false} is VALID [2022-04-08 04:37:13,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 04:37:13,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 04:37:13,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:37:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284759994] [2022-04-08 04:37:13,977 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 04:37:13,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127460032] [2022-04-08 04:37:13,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127460032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:37:13,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:37:13,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:38:03,934 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:38:03,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1265983483] [2022-04-08 04:38:03,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1265983483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:38:03,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:38:03,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 04:38:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3317288] [2022-04-08 04:38:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:38:03,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.2) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 28 [2022-04-08 04:38:03,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:38:03,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 1.2) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:38:06,596 WARN L143 InductivityCheck]: Transition 1041#(and (<= main_~s~0 (+ main_~n~0 main_~t~0)) (= (+ (* main_~s~0 4) (* main_~t~0 (- 4))) (+ (- 3) (* main_~t~0 2) (* (+ (- 2) main_~t~0) (+ (- 2) main_~t~0))))) ( _ , assume !false; , 1012#(or (and (= (mod main_~a~0 2) 0) (exists ((main_~n~0 Int) (main_~s~0 Int)) (and (<= main_~s~0 (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4))) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (and (= (+ (* (- 4) (div main_~a~0 2)) main_~s~0 (* (- 4) (div main_~a~0 2) (div main_~a~0 2)) (* v_itHalf_1 2) 1) (+ 2 (* v_itHalf_1 2))) (<= (+ main_~s~0 3 (* v_itHalf_1 8) (* (* v_itHalf_1 v_itHalf_1) 4)) (+ main_~n~0 (* (* (div main_~a~0 2) (div main_~a~0 2)) 4) (* (div main_~a~0 2) 4)))) (not (<= (+ v_itHalf_1 1) (div main_~a~0 2))))))) (= main_~t~0 (+ (* (div main_~a~0 2) 4) 1)) (< 0 (div main_~a~0 2))) (and (= main_~a~0 0) (= main_~t~0 1)) (and (= (mod (+ (* main_~t~0 3) 3) 4) 0) (<= 0 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) (= main_~a~0 (+ (* 2 (div (+ 3 (* (- 1) main_~t~0)) (- 4))) 1)) (exists ((main_~n~0 Int)) (and (<= 1 main_~n~0) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ 3 (* (- 1) main_~t~0)) (- 4)))) (not (<= 1 v_itHalf_1)) (<= (+ (* v_itHalf_1 4) (* (* v_itHalf_1 v_itHalf_1) 4) 1) main_~n~0))))))) ) not inductive [2022-04-08 04:38:06,615 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-08 04:38:06,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 04:38:06,797 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:38:06,800 INFO L158 Benchmark]: Toolchain (without parser) took 90472.99ms. Allocated memory was 178.3MB in the beginning and 235.9MB in the end (delta: 57.7MB). Free memory was 130.3MB in the beginning and 184.0MB in the end (delta: -53.7MB). Peak memory consumption was 4.8MB. Max. memory is 8.0GB. [2022-04-08 04:38:06,801 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 146.4MB in the beginning and 146.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:38:06,801 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.26ms. Allocated memory is still 178.3MB. Free memory was 130.2MB in the beginning and 154.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-08 04:38:06,801 INFO L158 Benchmark]: Boogie Preprocessor took 26.70ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:38:06,801 INFO L158 Benchmark]: RCFGBuilder took 288.33ms. Allocated memory is still 178.3MB. Free memory was 153.4MB in the beginning and 142.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 04:38:06,802 INFO L158 Benchmark]: TraceAbstraction took 89950.59ms. Allocated memory was 178.3MB in the beginning and 235.9MB in the end (delta: 57.7MB). Free memory was 141.8MB in the beginning and 184.0MB in the end (delta: -42.2MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-04-08 04:38:06,803 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.10ms. Allocated memory is still 178.3MB. Free memory was 146.4MB in the beginning and 146.3MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.26ms. Allocated memory is still 178.3MB. Free memory was 130.2MB in the beginning and 154.9MB in the end (delta: -24.7MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.70ms. Allocated memory is still 178.3MB. Free memory was 154.9MB in the beginning and 153.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 288.33ms. Allocated memory is still 178.3MB. Free memory was 153.4MB in the beginning and 142.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 89950.59ms. Allocated memory was 178.3MB in the beginning and 235.9MB in the end (delta: 57.7MB). Free memory was 141.8MB in the beginning and 184.0MB in the end (delta: -42.2MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:38:06,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...