/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:47:09,862 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:47:09,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:47:09,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:47:09,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:47:09,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:47:09,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:47:09,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:47:09,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:47:09,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:47:09,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:47:09,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:47:09,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:47:09,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:47:09,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:47:09,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:47:09,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:47:09,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:47:09,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:47:09,905 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:47:09,906 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:47:09,907 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:47:09,908 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:47:09,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:47:09,909 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:47:09,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:47:09,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:47:09,912 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:47:09,913 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:47:09,913 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:47:09,914 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:47:09,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:47:09,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:47:09,915 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:47:09,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:47:09,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:47:09,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:47:09,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:47:09,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:47:09,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:47:09,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:47:09,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:47:09,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:47:09,927 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:47:09,927 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:47:09,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:47:09,928 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:47:09,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:47:09,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:47:09,928 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:47:09,928 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:47:09,929 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:47:09,929 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:47:09,930 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:47:09,930 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:47:09,931 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:47:10,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:47:10,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:47:10,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:47:10,130 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:47:10,130 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:47:10,131 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-04-15 07:47:10,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b45a79b/c66dc36810ac491d9bc47ce371696ea1/FLAG6ac77f9ea [2022-04-15 07:47:10,559 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:47:10,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c [2022-04-15 07:47:10,566 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b45a79b/c66dc36810ac491d9bc47ce371696ea1/FLAG6ac77f9ea [2022-04-15 07:47:10,576 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b45a79b/c66dc36810ac491d9bc47ce371696ea1 [2022-04-15 07:47:10,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:47:10,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:47:10,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:47:10,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:47:10,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:47:10,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2642fbc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10, skipping insertion in model container [2022-04-15 07:47:10,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,596 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:47:10,608 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:47:10,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c[588,601] [2022-04-15 07:47:10,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:47:10,818 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:47:10,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound50.c[588,601] [2022-04-15 07:47:10,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:47:10,867 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:47:10,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10 WrapperNode [2022-04-15 07:47:10,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:47:10,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:47:10,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:47:10,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:47:10,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:47:10,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:47:10,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:47:10,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:47:10,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (1/1) ... [2022-04-15 07:47:10,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:47:10,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:47:10,940 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:47:10,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:47:10,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:47:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:47:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:47:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 07:47:10,979 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 07:47:10,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:47:10,980 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 07:47:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:47:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:47:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:47:10,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 07:47:10,982 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 07:47:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 07:47:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:47:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:47:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:47:10,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:47:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:47:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:47:10,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:47:11,032 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:47:11,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:47:11,193 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:47:11,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:47:11,204 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:47:11,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:47:11 BoogieIcfgContainer [2022-04-15 07:47:11,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:47:11,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:47:11,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:47:11,212 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:47:11,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:47:10" (1/3) ... [2022-04-15 07:47:11,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d8391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:47:11, skipping insertion in model container [2022-04-15 07:47:11,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:47:10" (2/3) ... [2022-04-15 07:47:11,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@431d8391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:47:11, skipping insertion in model container [2022-04-15 07:47:11,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:47:11" (3/3) ... [2022-04-15 07:47:11,221 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound50.c [2022-04-15 07:47:11,228 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:47:11,228 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:47:11,269 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:47:11,274 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:47:11,274 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:47:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:47:11,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:47:11,294 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:11,295 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:11,295 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:11,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:11,300 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-15 07:47:11,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:11,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1083019906] [2022-04-15 07:47:11,318 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-15 07:47:11,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:11,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233600724] [2022-04-15 07:47:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:11,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:47:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:11,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:47:11,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:47:11,540 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 07:47:11,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:47:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:11,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:47:11,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:47:11,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:47:11,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 07:47:11,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:47:11,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39#true} is VALID [2022-04-15 07:47:11,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 07:47:11,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 07:47:11,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-15 07:47:11,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {39#true} is VALID [2022-04-15 07:47:11,563 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {39#true} is VALID [2022-04-15 07:47:11,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 07:47:11,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 07:47:11,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 07:47:11,564 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 07:47:11,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {40#false} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {40#false} is VALID [2022-04-15 07:47:11,566 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-15 07:47:11,566 INFO L272 TraceCheckUtils]: 13: Hoare triple {40#false} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {40#false} is VALID [2022-04-15 07:47:11,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 07:47:11,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 07:47:11,566 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 07:47:11,567 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-15 07:47:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:11,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233600724] [2022-04-15 07:47:11,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233600724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:11,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:11,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:47:11,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:11,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1083019906] [2022-04-15 07:47:11,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1083019906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:11,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:11,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:47:11,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368244816] [2022-04-15 07:47:11,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:11,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:47:11,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:11,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:11,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:11,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:47:11,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:11,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:47:11,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:47:11,644 INFO L87 Difference]: Start difference. First operand has 36 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:11,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:11,906 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-15 07:47:11,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:47:11,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:47:11,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:47:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:11,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 07:47:11,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 07:47:12,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:12,056 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:47:12,056 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 07:47:12,059 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:47:12,062 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:12,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:47:12,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 07:47:12,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 07:47:12,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:12,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,104 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,104 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:12,110 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 07:47:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:47:12,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:12,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:12,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-15 07:47:12,112 INFO L87 Difference]: Start difference. First operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 31 states. [2022-04-15 07:47:12,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:12,116 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 07:47:12,116 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:47:12,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:12,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:12,117 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:12,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 14 states have call successors, (14), 4 states have call predecessors, (14), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-15 07:47:12,122 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-15 07:47:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:12,123 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-15 07:47:12,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-15 07:47:12,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 07:47:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:47:12,222 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:12,222 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:12,222 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:47:12,223 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:12,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:12,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-15 07:47:12,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:12,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [844401047] [2022-04-15 07:47:12,229 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:12,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-15 07:47:12,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:12,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152469415] [2022-04-15 07:47:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:12,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:47:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:12,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-15 07:47:12,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:47:12,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 07:47:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 07:47:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:12,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 07:47:12,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 07:47:12,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:47:12,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 07:47:12,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {301#true} call ULTIMATE.init(); {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:47:12,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {301#true} is VALID [2022-04-15 07:47:12,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:47:12,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 07:47:12,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-15 07:47:12,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {301#true} is VALID [2022-04-15 07:47:12,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {301#true} is VALID [2022-04-15 07:47:12,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 07:47:12,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 07:47:12,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 07:47:12,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 07:47:12,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {301#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 07:47:12,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} assume !false; {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} is VALID [2022-04-15 07:47:12,423 INFO L272 TraceCheckUtils]: 13: Hoare triple {310#(= (+ (* main_~n~0 6) 6) main_~z~0)} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {311#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:47:12,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {311#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {312#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:47:12,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-15 07:47:12,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 07:47:12,426 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-15 07:47:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:12,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152469415] [2022-04-15 07:47:12,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152469415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:12,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:12,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:47:12,429 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:12,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [844401047] [2022-04-15 07:47:12,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [844401047] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:12,429 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:12,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:47:12,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501850345] [2022-04-15 07:47:12,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:47:12,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:12,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:12,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:47:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:12,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:47:12,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:47:12,446 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:12,867 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 07:47:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:47:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-15 07:47:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:47:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:47:12,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 07:47:12,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:12,939 INFO L225 Difference]: With dead ends: 37 [2022-04-15 07:47:12,939 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:47:12,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-15 07:47:12,942 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:12,943 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:47:12,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:47:12,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 07:47:12,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:12,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,954 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,954 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:12,957 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:47:12,957 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:47:12,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:12,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:12,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-15 07:47:12,959 INFO L87 Difference]: Start difference. First operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 35 states. [2022-04-15 07:47:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:12,962 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 07:47:12,962 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:47:12,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:12,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:12,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:12,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 07:47:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 07:47:12,965 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-15 07:47:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:12,966 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 07:47:12,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 07:47:12,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 07:47:13,016 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-15 07:47:13,016 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 07:47:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 07:47:13,017 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:13,017 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:13,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:47:13,017 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:13,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-15 07:47:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:13,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542383627] [2022-04-15 07:47:13,019 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:13,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-15 07:47:13,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:13,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987650222] [2022-04-15 07:47:13,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:13,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:13,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:47:13,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1831991140] [2022-04-15 07:47:13,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:47:13,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:47:13,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:47:13,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:47:13,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 07:47:13,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:47:13,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:47:13,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:47:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:13,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:47:13,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 07:47:13,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {538#true} is VALID [2022-04-15 07:47:13,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:47:13,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-15 07:47:13,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 07:47:13,283 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {538#true} is VALID [2022-04-15 07:47:13,283 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {538#true} is VALID [2022-04-15 07:47:13,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 07:47:13,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 07:47:13,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:47:13,284 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-15 07:47:13,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {538#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:47:13,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} assume !false; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:47:13,300 INFO L272 TraceCheckUtils]: 13: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {538#true} is VALID [2022-04-15 07:47:13,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 07:47:13,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 07:47:13,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 07:47:13,302 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {538#true} {576#(and (= main_~n~0 0) (= main_~y~0 1))} #62#return; {576#(and (= main_~n~0 0) (= main_~y~0 1))} is VALID [2022-04-15 07:47:13,302 INFO L272 TraceCheckUtils]: 18: Hoare triple {576#(and (= main_~n~0 0) (= main_~y~0 1))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {598#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:47:13,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {598#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {602#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:13,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 07:47:13,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 07:47:13,305 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-15 07:47:13,305 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:47:13,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:13,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987650222] [2022-04-15 07:47:13,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:47:13,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831991140] [2022-04-15 07:47:13,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831991140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:13,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:13,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:13,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:13,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542383627] [2022-04-15 07:47:13,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542383627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:13,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:13,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112500118] [2022-04-15 07:47:13,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:13,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-15 07:47:13,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:13,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:47:13,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:13,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:47:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:13,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:47:13,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:47:13,328 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:47:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:13,566 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-15 07:47:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:47:13,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-15 07:47:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:47:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:47:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:13,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:47:13,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:13,675 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:47:13,675 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:47:13,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:47:13,680 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:13,686 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:47:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:47:13,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-15 07:47:13,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:13,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:47:13,708 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:47:13,709 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:47:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:13,721 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 07:47:13,721 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 07:47:13,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:13,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:13,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-15 07:47:13,726 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-04-15 07:47:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:13,729 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 07:47:13,729 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 07:47:13,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:13,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:13,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:13,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.1) internal successors, (22), 22 states have internal predecessors, (22), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 07:47:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-15 07:47:13,733 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-15 07:47:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:13,733 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-15 07:47:13,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 07:47:13,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-15 07:47:13,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-15 07:47:13,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 07:47:13,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:13,805 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:13,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 07:47:14,019 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-15 07:47:14,020 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-15 07:47:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:14,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709754646] [2022-04-15 07:47:14,021 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:14,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-15 07:47:14,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:14,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477586867] [2022-04-15 07:47:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:14,037 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:47:14,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1032650918] [2022-04-15 07:47:14,038 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:47:14,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:47:14,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:47:14,039 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:47:14,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 07:47:14,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:47:14,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:47:14,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 07:47:14,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:14,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:47:14,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-15 07:47:14,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {906#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {906#true} is VALID [2022-04-15 07:47:14,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:47:14,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-15 07:47:14,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-15 07:47:14,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {906#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {906#true} is VALID [2022-04-15 07:47:14,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {906#true} is VALID [2022-04-15 07:47:14,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:47:14,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:47:14,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:47:14,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-15 07:47:14,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:47:14,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} assume !false; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:47:14,220 INFO L272 TraceCheckUtils]: 13: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {906#true} is VALID [2022-04-15 07:47:14,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:47:14,220 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:47:14,220 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:47:14,221 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #62#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:47:14,221 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {906#true} is VALID [2022-04-15 07:47:14,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 07:47:14,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 07:47:14,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 07:47:14,227 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {906#true} {944#(and (= main_~x~0 0) (= main_~n~0 0))} #64#return; {944#(and (= main_~x~0 0) (= main_~n~0 0))} is VALID [2022-04-15 07:47:14,228 INFO L272 TraceCheckUtils]: 23: Hoare triple {944#(and (= main_~x~0 0) (= main_~n~0 0))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {981#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:47:14,229 INFO L290 TraceCheckUtils]: 24: Hoare triple {981#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {985#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:14,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-15 07:47:14,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-15 07:47:14,229 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-15 07:47:14,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:47:14,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477586867] [2022-04-15 07:47:14,230 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:47:14,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032650918] [2022-04-15 07:47:14,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032650918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:14,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:14,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:14,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:14,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709754646] [2022-04-15 07:47:14,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709754646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:14,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:14,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915045894] [2022-04-15 07:47:14,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:14,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 07:47:14,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:14,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:47:14,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:14,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:47:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:14,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:47:14,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:47:14,252 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:47:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:14,525 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 07:47:14,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:47:14,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-15 07:47:14,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:14,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:47:14,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:14,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:47:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:14,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:47:14,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:14,606 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:47:14,606 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 07:47:14,607 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:47:14,607 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:14,608 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 149 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:47:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 07:47:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-15 07:47:14,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:14,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:47:14,632 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:47:14,634 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:47:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:14,640 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 07:47:14,640 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 07:47:14,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:14,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:14,642 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-15 07:47:14,643 INFO L87 Difference]: Start difference. First operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 56 states. [2022-04-15 07:47:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:14,650 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 07:47:14,650 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 07:47:14,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:14,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:14,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:14,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 24 states have (on average 1.125) internal successors, (27), 26 states have internal predecessors, (27), 21 states have call successors, (21), 7 states have call predecessors, (21), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 07:47:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-15 07:47:14,655 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-15 07:47:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:14,655 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-15 07:47:14,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 07:47:14,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-15 07:47:14,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-15 07:47:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:47:14,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:14,736 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:14,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 07:47:14,947 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-15 07:47:14,948 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:14,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-15 07:47:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:14,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006203272] [2022-04-15 07:47:14,949 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:47:14,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-15 07:47:14,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:47:14,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582053373] [2022-04-15 07:47:14,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:47:14,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:47:14,969 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:47:14,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512590363] [2022-04-15 07:47:14,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 07:47:14,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:47:14,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:47:14,970 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:47:15,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 07:47:15,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 07:47:15,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 07:47:15,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 07:47:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:47:15,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:47:15,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-15 07:47:15,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1325#true} is VALID [2022-04-15 07:47:15,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:47:15,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-15 07:47:15,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-15 07:47:15,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {1325#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1325#true} is VALID [2022-04-15 07:47:15,209 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1325#true} is VALID [2022-04-15 07:47:15,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:47:15,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:47:15,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:47:15,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-15 07:47:15,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {1325#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:47:15,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} assume !false; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:47:15,211 INFO L272 TraceCheckUtils]: 13: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-15 07:47:15,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:47:15,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:47:15,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:47:15,213 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #62#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:47:15,213 INFO L272 TraceCheckUtils]: 18: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1325#true} is VALID [2022-04-15 07:47:15,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:47:15,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:47:15,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:47:15,215 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #64#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:47:15,216 INFO L272 TraceCheckUtils]: 23: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if ~x~0 == ~n~0 * ~n~0 * ~n~0 then 1 else 0)); {1325#true} is VALID [2022-04-15 07:47:15,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 07:47:15,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 07:47:15,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 07:47:15,217 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1325#true} {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} #66#return; {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:47:15,218 INFO L272 TraceCheckUtils]: 28: Hoare triple {1363#(and (= main_~x~0 0) (= main_~y~0 1) (= main_~z~0 6))} call __VERIFIER_assert((if 0 == ~y~0 * ~z~0 - 18 * ~x~0 - 12 * ~y~0 + 2 * ~z~0 - 6 then 1 else 0)); {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:47:15,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {1415#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1419#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:47:15,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-15 07:47:15,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-15 07:47:15,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 07:47:15,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 07:47:15,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:47:15,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582053373] [2022-04-15 07:47:15,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:47:15,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512590363] [2022-04-15 07:47:15,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512590363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:15,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:15,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:15,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:47:15,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006203272] [2022-04-15 07:47:15,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006203272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:47:15,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:47:15,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:47:15,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264575602] [2022-04-15 07:47:15,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:47:15,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 07:47:15,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:47:15,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:47:15,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:15,241 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:47:15,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:15,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:47:15,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:47:15,242 INFO L87 Difference]: Start difference. First operand 52 states and 67 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:47:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:15,595 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-15 07:47:15,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:47:15,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 07:47:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:47:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:47:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:47:15,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 07:47:15,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 07:47:15,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:15,676 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:47:15,676 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 07:47:15,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:47:15,678 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:47:15,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 135 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:47:15,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 07:47:15,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 07:47:15,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:47:15,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:47:15,700 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:47:15,700 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:47:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:15,703 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 07:47:15,703 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:47:15,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:15,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:15,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-15 07:47:15,704 INFO L87 Difference]: Start difference. First operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 54 states. [2022-04-15 07:47:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:47:15,707 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 07:47:15,707 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:47:15,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:47:15,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:47:15,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:47:15,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:47:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 19 states have call successors, (19), 8 states have call predecessors, (19), 7 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-15 07:47:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-15 07:47:15,711 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-15 07:47:15,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:47:15,711 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-15 07:47:15,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 07:47:15,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-15 07:47:15,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:47:15,793 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 07:47:15,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 07:47:15,794 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:47:15,794 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:47:15,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 07:47:16,007 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-15 07:47:16,007 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:47:16,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:47:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-15 07:47:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:47:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242678944] [2022-04-15 07:49:50,764 WARN L232 SmtUtils]: Spent 2.56m on a formula simplification. DAG size of input: 192 DAG size of output: 188 (called from [L 564] de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.jordan.JordanLoopAcceleration.buildAccelerationFormula) [2022-04-15 07:49:50,802 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 4=1}}, 0 SequentialAcceleration, 1 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:49:50,809 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:49:50,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1018400594, now seen corresponding path program 1 times [2022-04-15 07:49:50,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:49:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415069691] [2022-04-15 07:49:50,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:50,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:49:50,835 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 07:49:50,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [380693969] [2022-04-15 07:49:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:49:50,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:49:50,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:49:50,837 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 07:49:50,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 07:49:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:51,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 07:49:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:49:51,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 07:49:55,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 07:49:55,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 07:49:55,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:49:55,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:49:55,933 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-15 07:49:55,934 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} is VALID [2022-04-15 07:49:55,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {1813#(and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6))} [88] L33-2-->L34_primed: Formula: (let ((.cse28 (* v_main_~y~0_26 12))) (let ((.cse4 (= (+ 12 (* v_main_~z~0_30 v_main_~z~0_30)) (+ .cse28 (* v_main_~z~0_30 6)))) (.cse1 (* v_main_~z~0_29 11)) (.cse10 (= (+ .cse28 6 (* v_main_~x~0_20 18)) (+ (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)))) (.cse11 (* (- 1) v_main_~z~0_29)) (.cse26 (<= v_main_~n~0_21 v_main_~a~0_12)) (.cse27 (= v_main_~x~0_20 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (.cse12 (= v_main_~n~0_21 v_main_~n~0_20)) (.cse13 (= v_main_~y~0_26 v_main_~y~0_25)) (.cse14 (= v_main_~x~0_20 v_main_~x~0_19))) (or (let ((.cse0 (div (+ .cse11 v_main_~z~0_30) (- 12)))) (let ((.cse2 (* v_main_~z~0_30 .cse0)) (.cse3 (* (* .cse0 .cse0) 12))) (and (= v_main_~n~0_20 (+ v_main_~n~0_21 (* 2 .cse0))) (< 0 .cse0) (= 0 (mod (+ v_main_~z~0_30 .cse1) 12)) (= (+ (* 6 .cse0) v_main_~y~0_25) (+ v_main_~y~0_26 (* 2 .cse2) .cse3)) .cse4 (forall ((v_itHalf_1 Int)) (or (let ((.cse6 (* v_main_~y~0_26 v_itHalf_1)) (.cse9 (* v_itHalf_1 v_itHalf_1)) (.cse7 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse8 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse5 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse5 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse6 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse7 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse8 (* .cse9 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse5 12) (* v_main_~x~0_20 18) (* .cse6 24) (* 72 .cse9)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse7 7 (* v_itHalf_1 12) .cse8 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse5 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30) (- 12)))))) (= (+ v_main_~x~0_19 .cse2 .cse3) (+ (* 2 (* v_main_~y~0_26 .cse0)) v_main_~x~0_20 (* 4 .cse0) (* 2 (* v_main_~z~0_30 .cse0 .cse0)) (* (* .cse0 .cse0 .cse0) 8))) .cse10))) (and .cse12 (= v_main_~z~0_30 v_main_~z~0_29) (= v_main_~a~0_12 v_main_~a~0_12) .cse13 .cse14) (let ((.cse24 (div (+ .cse11 v_main_~z~0_30 6) (- 12)))) (let ((.cse20 (* .cse24 2)) (.cse25 (* .cse24 v_main_~z~0_30)) (.cse23 (* .cse24 .cse24))) (and (forall ((v_itHalf_1 Int)) (or (let ((.cse16 (* v_main_~y~0_26 v_itHalf_1)) (.cse19 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse18 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse15 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse15 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse16 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse17 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse18 (* .cse19 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse15 12) (* v_main_~x~0_20 18) (* .cse16 24) (* 72 .cse19)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse17 7 (* v_itHalf_1 12) .cse18 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse15 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))))) (= v_main_~n~0_20 (+ v_main_~n~0_21 .cse20 1)) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))) (let ((.cse22 (* v_main_~y~0_26 v_itHalf_1)) (.cse21 (* v_main_~z~0_30 v_itHalf_1))) (and (<= (+ v_main_~n~0_21 (* v_itHalf_1 2)) v_main_~a~0_12) (= (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)) (+ (* v_main_~y~0_26 12) 6 (* .cse21 12) (* v_main_~x~0_20 18) (* .cse22 24))) (= (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) (* (* v_itHalf_1 v_itHalf_1) 12) .cse21 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21)) (+ v_main_~x~0_20 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse22 2))) (= (+ v_main_~y~0_26 (* .cse21 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1) 12) (* v_itHalf_1 12) (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) (not (<= 1 v_itHalf_1)))) (= v_main_~y~0_25 (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse23 12) (* .cse24 6) (* .cse25 2))) (= (+ v_main_~x~0_19 .cse20) (+ .cse25 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* .cse24 .cse24 v_main_~z~0_30)) (* .cse23 4) (* 2 (* .cse24 v_main_~y~0_26)) (* 8 (* .cse24 .cse24 .cse24)))) .cse26 .cse4 (= (mod (+ v_main_~z~0_30 6 .cse1) 12) 0) (<= 0 .cse24) .cse27 .cse10))) (and (= v_main_~z~0_29 v_main_~z~0_30) (or (not .cse26) (not (= v_main_~z~0_30 (+ 6 (* v_main_~n~0_21 6)))) (not .cse27) (not (= v_main_~y~0_26 (+ (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) .cse12 .cse13 .cse14)))) InVars {main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_12} OutVars{main_~y~0=v_main_~y~0_25, main_~n~0=v_main_~n~0_20, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_29, main_~a~0=v_main_~a~0_12} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))))} is VALID [2022-04-15 07:49:55,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))))} [87] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))))} is VALID [2022-04-15 07:49:55,952 INFO L272 TraceCheckUtils]: 14: Hoare triple {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:49:55,953 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} ~cond := #in~cond; {1827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:55,953 INFO L290 TraceCheckUtils]: 16: Hoare triple {1827#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:55,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:49:56,486 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} {1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6)))))} #62#return; {1838#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} is VALID [2022-04-15 07:49:56,499 INFO L272 TraceCheckUtils]: 19: Hoare triple {1838#(or (and (= (+ main_~y~0 (* 6 (div (* main_~n~0 (- 6)) (- 12)))) (+ (* (* (div (* main_~n~0 (- 6)) (- 12)) (div (* main_~n~0 (- 6)) (- 12))) 12) (* 12 (div (* main_~n~0 (- 6)) (- 12))) 1)) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (* main_~n~0 (- 6)) (- 12)))) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (< 0 (div (* main_~n~0 (- 6)) (- 12))) (= (mod (* main_~n~0 6) 12) 0)) (and (= main_~n~0 0) (= main_~y~0 1)) (and (= (+ 7 (* 12 (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))) (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 18)) main_~y~0) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ 6 (* main_~n~0 (- 6))) (- 12)))))) (<= 0 (div (+ 6 (* main_~n~0 (- 6))) (- 12))) (= main_~n~0 (+ (* (div (+ 6 (* main_~n~0 (- 6))) (- 12)) 2) 1))))} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:49:56,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:49:56,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:49:56,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:49:56,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:49:56,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 07:50:06,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {1776#false} assume !false; {1776#false} is VALID [2022-04-15 07:50:06,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {1846#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1776#false} is VALID [2022-04-15 07:50:06,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1846#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 07:50:06,570 INFO L272 TraceCheckUtils]: 19: Hoare triple {1862#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} call __VERIFIER_assert((if ~y~0 == 1 + (3 * ~n~0 * ~n~0 + 3 * ~n~0) then 1 else 0)); {1842#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 07:50:06,570 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} #62#return; {1862#(= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0)} is VALID [2022-04-15 07:50:06,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:50:06,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1831#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 07:50:06,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {1775#true} ~cond := #in~cond; {1876#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 07:50:06,572 INFO L272 TraceCheckUtils]: 14: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} call __VERIFIER_assert((if ~z~0 == 6 + 6 * ~n~0 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:50:06,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [87] L34_primed-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-15 07:50:08,672 WARN L290 TraceCheckUtils]: 12: Hoare triple {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} [88] L33-2-->L34_primed: Formula: (let ((.cse28 (* v_main_~y~0_26 12))) (let ((.cse4 (= (+ 12 (* v_main_~z~0_30 v_main_~z~0_30)) (+ .cse28 (* v_main_~z~0_30 6)))) (.cse1 (* v_main_~z~0_29 11)) (.cse10 (= (+ .cse28 6 (* v_main_~x~0_20 18)) (+ (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)))) (.cse11 (* (- 1) v_main_~z~0_29)) (.cse26 (<= v_main_~n~0_21 v_main_~a~0_12)) (.cse27 (= v_main_~x~0_20 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (.cse12 (= v_main_~n~0_21 v_main_~n~0_20)) (.cse13 (= v_main_~y~0_26 v_main_~y~0_25)) (.cse14 (= v_main_~x~0_20 v_main_~x~0_19))) (or (let ((.cse0 (div (+ .cse11 v_main_~z~0_30) (- 12)))) (let ((.cse2 (* v_main_~z~0_30 .cse0)) (.cse3 (* (* .cse0 .cse0) 12))) (and (= v_main_~n~0_20 (+ v_main_~n~0_21 (* 2 .cse0))) (< 0 .cse0) (= 0 (mod (+ v_main_~z~0_30 .cse1) 12)) (= (+ (* 6 .cse0) v_main_~y~0_25) (+ v_main_~y~0_26 (* 2 .cse2) .cse3)) .cse4 (forall ((v_itHalf_1 Int)) (or (let ((.cse6 (* v_main_~y~0_26 v_itHalf_1)) (.cse9 (* v_itHalf_1 v_itHalf_1)) (.cse7 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse8 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse5 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse5 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse6 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse7 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse8 (* .cse9 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse5 12) (* v_main_~x~0_20 18) (* .cse6 24) (* 72 .cse9)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse7 7 (* v_itHalf_1 12) .cse8 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse5 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30) (- 12)))))) (= (+ v_main_~x~0_19 .cse2 .cse3) (+ (* 2 (* v_main_~y~0_26 .cse0)) v_main_~x~0_20 (* 4 .cse0) (* 2 (* v_main_~z~0_30 .cse0 .cse0)) (* (* .cse0 .cse0 .cse0) 8))) .cse10))) (and .cse12 (= v_main_~z~0_30 v_main_~z~0_29) (= v_main_~a~0_12 v_main_~a~0_12) .cse13 .cse14) (let ((.cse24 (div (+ .cse11 v_main_~z~0_30 6) (- 12)))) (let ((.cse20 (* .cse24 2)) (.cse25 (* .cse24 v_main_~z~0_30)) (.cse23 (* .cse24 .cse24))) (and (forall ((v_itHalf_1 Int)) (or (let ((.cse16 (* v_main_~y~0_26 v_itHalf_1)) (.cse19 (* v_itHalf_1 v_itHalf_1)) (.cse17 (* (* v_main_~n~0_21 v_itHalf_1) 12)) (.cse18 (* 3 (* v_main_~n~0_21 v_main_~n~0_21))) (.cse15 (* v_main_~z~0_30 v_itHalf_1))) (and (= (+ .cse15 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse16 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) .cse17 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 3) .cse18 (* .cse19 8) (* v_itHalf_1 8) 1 (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21))) (= (+ (* v_main_~z~0_30 4) (* v_main_~y~0_26 24) (* .cse15 12) (* v_main_~x~0_20 18) (* .cse16 24) (* 72 .cse19)) (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) 6 (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 v_main_~z~0_30))) (= (+ .cse17 7 (* v_itHalf_1 12) .cse18 (* v_main_~n~0_21 9)) (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse15 2))) (<= (+ v_main_~n~0_21 (* v_itHalf_1 2) 1) v_main_~a~0_12))) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))))) (= v_main_~n~0_20 (+ v_main_~n~0_21 .cse20 1)) (forall ((v_itHalf_1 Int)) (or (not (<= v_itHalf_1 (div (+ (* (- 1) v_main_~z~0_29) v_main_~z~0_30 6) (- 12)))) (let ((.cse22 (* v_main_~y~0_26 v_itHalf_1)) (.cse21 (* v_main_~z~0_30 v_itHalf_1))) (and (<= (+ v_main_~n~0_21 (* v_itHalf_1 2)) v_main_~a~0_12) (= (+ (* v_itHalf_1 24) (* 2 (* v_main_~z~0_30 v_main_~z~0_30 v_itHalf_1)) (* v_main_~y~0_26 v_main_~z~0_30) (* v_main_~z~0_30 2)) (+ (* v_main_~y~0_26 12) 6 (* .cse21 12) (* v_main_~x~0_20 18) (* .cse22 24))) (= (+ (* (* v_main_~n~0_21 v_itHalf_1 v_itHalf_1) 12) (* (* v_itHalf_1 v_itHalf_1) 12) .cse21 (* 6 (* v_main_~n~0_21 v_main_~n~0_21 v_itHalf_1)) (* v_main_~n~0_21 v_main_~n~0_21 v_main_~n~0_21)) (+ v_main_~x~0_20 (* v_itHalf_1 4) (* 2 (* v_main_~z~0_30 v_itHalf_1 v_itHalf_1)) (* .cse22 2))) (= (+ v_main_~y~0_26 (* .cse21 2)) (+ (* (* v_main_~n~0_21 v_itHalf_1) 12) (* v_itHalf_1 12) (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) (not (<= 1 v_itHalf_1)))) (= v_main_~y~0_25 (+ v_main_~y~0_26 v_main_~z~0_30 (* .cse23 12) (* .cse24 6) (* .cse25 2))) (= (+ v_main_~x~0_19 .cse20) (+ .cse25 v_main_~x~0_20 v_main_~y~0_26 (* 2 (* .cse24 .cse24 v_main_~z~0_30)) (* .cse23 4) (* 2 (* .cse24 v_main_~y~0_26)) (* 8 (* .cse24 .cse24 .cse24)))) .cse26 .cse4 (= (mod (+ v_main_~z~0_30 6 .cse1) 12) 0) (<= 0 .cse24) .cse27 .cse10))) (and (= v_main_~z~0_29 v_main_~z~0_30) (or (not .cse26) (not (= v_main_~z~0_30 (+ 6 (* v_main_~n~0_21 6)))) (not .cse27) (not (= v_main_~y~0_26 (+ (* v_main_~n~0_21 3) (* 3 (* v_main_~n~0_21 v_main_~n~0_21)) 1)))) .cse12 .cse13 .cse14)))) InVars {main_~y~0=v_main_~y~0_26, main_~n~0=v_main_~n~0_21, main_~x~0=v_main_~x~0_20, main_~z~0=v_main_~z~0_30, main_~a~0=v_main_~a~0_12} OutVars{main_~y~0=v_main_~y~0_25, main_~n~0=v_main_~n~0_20, main_~x~0=v_main_~x~0_19, main_~z~0=v_main_~z~0_29, main_~a~0=v_main_~a~0_12} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is UNKNOWN [2022-04-15 07:50:08,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#true} ~n~0 := 0;~x~0 := 0;~y~0 := 1;~z~0 := 6; {1866#(or (not (= (+ (* main_~n~0 6) 6) main_~z~0)) (= (+ (* 3 (* main_~n~0 main_~n~0)) (* main_~n~0 3) 1) main_~y~0))} is VALID [2022-04-15 07:50:08,673 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1775#true} {1775#true} #60#return; {1775#true} is VALID [2022-04-15 07:50:08,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:50:08,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {1775#true} assume !(0 == ~cond); {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {1775#true} ~cond := #in~cond; {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 50 then 1 else 0)); {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#true} havoc ~a~0;havoc ~n~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;~a~0 := (if #t~nondet4 % 65536 % 65536 <= 32767 then #t~nondet4 % 65536 % 65536 else #t~nondet4 % 65536 % 65536 - 65536);havoc #t~nondet4; {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#true} call #t~ret5 := main(); {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#true} {1775#true} #84#return; {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#true} assume true; {1775#true} is VALID [2022-04-15 07:50:08,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {1775#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1775#true} is VALID [2022-04-15 07:50:08,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {1775#true} call ULTIMATE.init(); {1775#true} is VALID [2022-04-15 07:50:08,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:50:08,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:50:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415069691] [2022-04-15 07:50:08,675 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 07:50:08,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380693969] [2022-04-15 07:50:08,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380693969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 07:50:08,676 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 07:50:08,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-15 07:50:27,284 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:50:27,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242678944] [2022-04-15 07:50:27,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242678944] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:50:27,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:50:27,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:50:27,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073880087] [2022-04-15 07:50:27,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:50:27,286 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 11 states have internal predecessors, (23), 8 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 49 [2022-04-15 07:50:27,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:50:27,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 15 states have (on average 1.5333333333333334) internal successors, (23), 11 states have internal predecessors, (23), 8 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-15 07:50:31,897 WARN L143 InductivityCheck]: Transition 1933#(and (= (+ (* (+ main_~z~0 (- 6)) (+ main_~z~0 (- 6))) (* main_~z~0 6) (* main_~y~0 (- 12)) (- 24)) 0) (<= main_~n~0 (+ main_~a~0 1))) ( _ , assume !false; , 1817#(or (and (= main_~n~0 0) (= main_~y~0 1) (= main_~z~0 6)) (and (= main_~n~0 (+ (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 2) 1)) (<= 0 (div (+ (* (- 1) main_~z~0) 12) (- 12))) (forall ((v_itHalf_1 Int)) (or (= (* 72 (* v_itHalf_1 v_itHalf_1)) 0) (not (<= 0 v_itHalf_1)) (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 12) (- 12)))))) (= (+ 7 (* 12 (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) (div (+ (* (- 1) main_~z~0) 12) (- 12)))) (* (div (+ (* (- 1) main_~z~0) 12) (- 12)) 18)) main_~y~0) (= (mod (* main_~z~0 11) 12) 0)) (and (= (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 2) main_~n~0) (= (mod (+ (* main_~z~0 11) 6) 12) 0) (< 0 (div (+ (* (- 1) main_~z~0) 6) (- 12))) (exists ((main_~a~0 Int)) (forall ((v_itHalf_1 Int)) (or (not (<= (+ v_itHalf_1 1) (div (+ (* (- 1) main_~z~0) 6) (- 12)))) (not (<= 0 v_itHalf_1)) (and (<= (+ (* v_itHalf_1 2) 1) main_~a~0) (= (+ (* v_itHalf_1 96) 48) (+ (* v_itHalf_1 96) 48 (* 72 (* v_itHalf_1 v_itHalf_1)))))))) (= (+ (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 12) (* (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) (div (+ (* (- 1) main_~z~0) 6) (- 12))) 12) 1) (+ main_~y~0 (* (div (+ (* (- 1) main_~z~0) 6) (- 12)) 6))))) ) not inductive [2022-04-15 07:50:31,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 07:50:32,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 07:50:32,099 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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 07:50:32,102 INFO L158 Benchmark]: Toolchain (without parser) took 201521.49ms. Allocated memory was 255.9MB in the beginning and 400.6MB in the end (delta: 144.7MB). Free memory was 196.1MB in the beginning and 166.3MB in the end (delta: 29.8MB). Peak memory consumption was 174.8MB. Max. memory is 8.0GB. [2022-04-15 07:50:32,102 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 212.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:50:32,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.60ms. Allocated memory was 255.9MB in the beginning and 333.4MB in the end (delta: 77.6MB). Free memory was 195.9MB in the beginning and 300.8MB in the end (delta: -104.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2022-04-15 07:50:32,103 INFO L158 Benchmark]: Boogie Preprocessor took 45.16ms. Allocated memory is still 333.4MB. Free memory was 300.8MB in the beginning and 299.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:50:32,103 INFO L158 Benchmark]: RCFGBuilder took 291.39ms. Allocated memory is still 333.4MB. Free memory was 299.2MB in the beginning and 287.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 07:50:32,103 INFO L158 Benchmark]: TraceAbstraction took 200893.71ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 286.9MB in the beginning and 166.3MB in the end (delta: 120.6MB). Peak memory consumption was 189.3MB. Max. memory is 8.0GB. [2022-04-15 07:50:32,104 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 255.9MB. Free memory is still 212.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.60ms. Allocated memory was 255.9MB in the beginning and 333.4MB in the end (delta: 77.6MB). Free memory was 195.9MB in the beginning and 300.8MB in the end (delta: -104.9MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.16ms. Allocated memory is still 333.4MB. Free memory was 300.8MB in the beginning and 299.5MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 291.39ms. Allocated memory is still 333.4MB. Free memory was 299.2MB in the beginning and 287.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 200893.71ms. Allocated memory was 333.4MB in the beginning and 400.6MB in the end (delta: 67.1MB). Free memory was 286.9MB in the beginning and 166.3MB in the end (delta: 120.6MB). Peak memory consumption was 189.3MB. 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-15 07:50:32,339 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-04-15 07:50:32,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...