/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:53:46,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:53:46,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:53:46,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:53:46,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:53:46,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:53:46,857 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:53:46,859 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:53:46,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:53:46,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:53:46,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:53:46,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:53:46,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:53:46,869 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:53:46,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:53:46,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:53:46,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:53:46,874 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:53:46,876 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:53:46,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:53:46,884 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:53:46,885 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:53:46,885 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:53:46,886 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:53:46,887 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:53:46,893 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:53:46,894 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:53:46,894 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:53:46,895 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:53:46,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:53:46,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:53:46,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:53:46,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:53:46,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:53:46,899 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:53:46,900 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:53:46,900 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:53:46,901 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:53:46,901 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:53:46,901 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:53:46,902 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:53:46,903 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:53:46,904 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:53:46,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:53:46,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:53:46,913 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:53:46,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:53:46,915 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:53:46,915 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:53:46,916 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:53:46,916 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:53:46,916 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:53:46,916 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:53:46,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:53:46,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:53:46,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:53:46,917 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:53:46,917 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:53:46,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:53:46,917 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:53:46,917 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 13:53:47,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:53:47,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:53:47,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:53:47,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:53:47,181 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:53:47,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-15 13:53:47,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbf46401/f9dedb840e8549edb01d229180f61177/FLAG7fa103f5f [2022-04-15 13:53:47,570 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:53:47,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohencu-ll_valuebound100.c [2022-04-15 13:53:47,575 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbf46401/f9dedb840e8549edb01d229180f61177/FLAG7fa103f5f [2022-04-15 13:53:47,584 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbf46401/f9dedb840e8549edb01d229180f61177 [2022-04-15 13:53:47,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:53:47,587 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:53:47,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:53:47,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:53:47,594 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:53:47,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381fafaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47, skipping insertion in model container [2022-04-15 13:53:47,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:53:47,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:53:47,743 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_valuebound100.c[588,601] [2022-04-15 13:53:47,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:53:47,788 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:53:47,796 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_valuebound100.c[588,601] [2022-04-15 13:53:47,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:53:47,816 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:53:47,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47 WrapperNode [2022-04-15 13:53:47,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:53:47,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:53:47,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:53:47,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:53:47,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,829 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,847 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:53:47,848 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:53:47,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:53:47,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:53:47,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (1/1) ... [2022-04-15 13:53:47,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:53:47,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:53:47,880 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 13:53:47,883 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 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:53:47,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:53:47,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ushort [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:53:47,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:53:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:53:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:53:47,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:53:47,961 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:53:47,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:53:48,080 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:53:48,086 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:53:48,087 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 13:53:48,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:53:48 BoogieIcfgContainer [2022-04-15 13:53:48,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:53:48,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:53:48,089 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:53:48,096 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:53:48,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:53:47" (1/3) ... [2022-04-15 13:53:48,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d02a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:53:48, skipping insertion in model container [2022-04-15 13:53:48,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:53:47" (2/3) ... [2022-04-15 13:53:48,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d02a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:53:48, skipping insertion in model container [2022-04-15 13:53:48,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:53:48" (3/3) ... [2022-04-15 13:53:48,098 INFO L111 eAbstractionObserver]: Analyzing ICFG cohencu-ll_valuebound100.c [2022-04-15 13:53:48,101 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:53:48,101 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:53:48,128 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:53:48,133 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 13:53:48,133 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:53:48,148 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 13:53:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:53:48,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:48,155 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 13:53:48,155 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:48,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:48,159 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 1 times [2022-04-15 13:53:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:48,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [353658224] [2022-04-15 13:53:48,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:53:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 503189915, now seen corresponding path program 2 times [2022-04-15 13:53:48,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:53:48,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310030061] [2022-04-15 13:53:48,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:53:48,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:53:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:48,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:53:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:48,326 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 13:53:48,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 13:53:48,327 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 13:53:48,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:53:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:48,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 13:53:48,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 13:53:48,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 13:53:48,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 13:53:48,352 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 13:53:48,353 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 13:53:48,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-15 13:53:48,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #84#return; {39#true} is VALID [2022-04-15 13:53:48,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret5 := main(); {39#true} is VALID [2022-04-15 13:53:48,354 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 13:53:48,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {39#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {39#true} is VALID [2022-04-15 13:53:48,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2022-04-15 13:53:48,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2022-04-15 13:53:48,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#false} assume true; {40#false} is VALID [2022-04-15 13:53:48,355 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#false} {39#true} #60#return; {40#false} is VALID [2022-04-15 13:53:48,355 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 13:53:48,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#false} assume !true; {40#false} is VALID [2022-04-15 13:53:48,356 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 13:53:48,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2022-04-15 13:53:48,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2022-04-15 13:53:48,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-15 13:53:48,357 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 13:53:48,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:53:48,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310030061] [2022-04-15 13:53:48,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310030061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:48,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:48,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:53:48,361 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:53:48,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [353658224] [2022-04-15 13:53:48,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [353658224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:48,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:48,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:53:48,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920663513] [2022-04-15 13:53:48,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:53:48,367 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 13:53:48,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:53:48,388 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 13:53:48,435 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 13:53:48,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:53:48,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:53:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:53:48,470 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 13:53:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:48,690 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-04-15 13:53:48,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:53:48,691 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 13:53:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:53:48,692 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 13:53:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 13:53:48,703 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 13:53:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 13:53:48,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 13:53:48,829 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 13:53:48,837 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:53:48,837 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 13:53:48,840 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 13:53:48,843 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:53:48,844 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.0s Time] [2022-04-15 13:53:48,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 13:53:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 13:53:48,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:53:48,872 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 13:53:48,873 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 13:53:48,873 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 13:53:48,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:48,879 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 13:53:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 13:53:48,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:48,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:48,880 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 13:53:48,881 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 13:53:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:48,885 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-04-15 13:53:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 13:53:48,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:48,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:48,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:53:48,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:53:48,887 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 13:53:48,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-04-15 13:53:48,894 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 17 [2022-04-15 13:53:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:53:48,895 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-04-15 13:53:48,895 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 13:53:48,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 41 transitions. [2022-04-15 13:53:48,945 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 13:53:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-04-15 13:53:48,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 13:53:48,947 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:48,947 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 13:53:48,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:53:48,948 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:48,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 1 times [2022-04-15 13:53:48,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:48,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2000305891] [2022-04-15 13:53:48,957 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:53:48,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1171868123, now seen corresponding path program 2 times [2022-04-15 13:53:48,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:53:48,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880034294] [2022-04-15 13:53:48,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:53:48,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:53:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:49,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:53:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:49,140 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 13:53:49,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:53:49,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 13:53:49,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 13:53:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:49,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 13:53:49,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 13:53:49,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:53:49,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 13:53:49,153 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 13:53:49,153 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 13:53:49,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:53:49,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {301#true} {301#true} #84#return; {301#true} is VALID [2022-04-15 13:53:49,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {301#true} call #t~ret5 := main(); {301#true} is VALID [2022-04-15 13:53:49,154 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 13:53:49,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {301#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {301#true} is VALID [2022-04-15 13:53:49,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#true} ~cond := #in~cond; {301#true} is VALID [2022-04-15 13:53:49,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#true} assume !(0 == ~cond); {301#true} is VALID [2022-04-15 13:53:49,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {301#true} assume true; {301#true} is VALID [2022-04-15 13:53:49,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {301#true} {301#true} #60#return; {301#true} is VALID [2022-04-15 13:53:49,156 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 13:53:49,158 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 13:53:49,158 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 13:53:49,159 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 13:53:49,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {302#false} is VALID [2022-04-15 13:53:49,161 INFO L290 TraceCheckUtils]: 16: Hoare triple {302#false} assume !false; {302#false} is VALID [2022-04-15 13:53:49,161 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 13:53:49,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:53:49,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880034294] [2022-04-15 13:53:49,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880034294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:49,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:49,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:53:49,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:53:49,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2000305891] [2022-04-15 13:53:49,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2000305891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:49,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:49,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:53:49,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683372206] [2022-04-15 13:53:49,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:53:49,167 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 13:53:49,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:53:49,168 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 13:53:49,183 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 13:53:49,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:53:49,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:49,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:53:49,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:53:49,186 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 13:53:49,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:49,665 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-04-15 13:53:49,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 13:53:49,665 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 13:53:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:53:49,666 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 13:53:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 13:53:49,669 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 13:53:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 13:53:49,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 13:53:49,739 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 13:53:49,741 INFO L225 Difference]: With dead ends: 37 [2022-04-15 13:53:49,741 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:53:49,741 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 13:53:49,743 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 13:53:49,743 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 13:53:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:53:49,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 13:53:49,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:53:49,752 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 13:53:49,753 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 13:53:49,753 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 13:53:49,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:49,756 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 13:53:49,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 13:53:49,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:49,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:49,758 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 13:53:49,758 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 13:53:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:49,761 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-15 13:53:49,761 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 13:53:49,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:49,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:49,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:53:49,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:53:49,763 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 13:53:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2022-04-15 13:53:49,766 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 17 [2022-04-15 13:53:49,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:53:49,767 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2022-04-15 13:53:49,767 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 13:53:49,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 44 transitions. [2022-04-15 13:53:49,817 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 13:53:49,818 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2022-04-15 13:53:49,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:53:49,819 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:49,820 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 13:53:49,820 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:53:49,820 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:49,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 1 times [2022-04-15 13:53:49,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:49,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [175695007] [2022-04-15 13:53:49,832 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:53:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1781524074, now seen corresponding path program 2 times [2022-04-15 13:53:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:53:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12254119] [2022-04-15 13:53:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:53:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:53:49,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:53:49,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537520867] [2022-04-15 13:53:49,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:53:49,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:53:49,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:53:49,862 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 13:53:49,863 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 13:53:49,903 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:53:49,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:53:49,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:53:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:49,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:53:50,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2022-04-15 13:53:50,060 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 13:53:50,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 13:53:50,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #84#return; {538#true} is VALID [2022-04-15 13:53:50,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2022-04-15 13:53:50,061 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 13:53:50,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {538#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {538#true} is VALID [2022-04-15 13:53:50,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 13:53:50,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 13:53:50,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 13:53:50,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {538#true} {538#true} #60#return; {538#true} is VALID [2022-04-15 13:53:50,066 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 13:53:50,066 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 13:53:50,066 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 13:53:50,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {538#true} ~cond := #in~cond; {538#true} is VALID [2022-04-15 13:53:50,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {538#true} assume !(0 == ~cond); {538#true} is VALID [2022-04-15 13:53:50,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#true} assume true; {538#true} is VALID [2022-04-15 13:53:50,072 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 13:53:50,073 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 13:53:50,073 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 13:53:50,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {602#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {539#false} is VALID [2022-04-15 13:53:50,074 INFO L290 TraceCheckUtils]: 21: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-04-15 13:53:50,074 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 13:53:50,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:53:50,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:53:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12254119] [2022-04-15 13:53:50,075 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:53:50,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537520867] [2022-04-15 13:53:50,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537520867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:50,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:50,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:50,076 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:53:50,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [175695007] [2022-04-15 13:53:50,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [175695007] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:50,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:50,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:50,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289640475] [2022-04-15 13:53:50,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:53:50,077 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 13:53:50,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:53:50,077 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 13:53:50,105 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 13:53:50,105 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:53:50,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:50,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:53:50,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:53:50,106 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 13:53:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:50,406 INFO L93 Difference]: Finished difference Result 54 states and 73 transitions. [2022-04-15 13:53:50,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:53:50,407 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 13:53:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:53:50,407 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 13:53:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:50,410 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 13:53:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:50,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 13:53:50,486 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 13:53:50,489 INFO L225 Difference]: With dead ends: 54 [2022-04-15 13:53:50,489 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 13:53:50,489 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 13:53:50,490 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 13:53:50,490 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 13:53:50,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 13:53:50,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-15 13:53:50,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:53:50,504 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 13:53:50,504 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 13:53:50,505 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 13:53:50,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:50,509 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:53:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:53:50,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:50,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:50,510 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 13:53:50,511 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 13:53:50,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:50,514 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2022-04-15 13:53:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 71 transitions. [2022-04-15 13:53:50,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:50,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:50,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:53:50,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:53:50,516 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 13:53:50,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2022-04-15 13:53:50,519 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 22 [2022-04-15 13:53:50,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:53:50,519 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2022-04-15 13:53:50,520 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 13:53:50,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 52 transitions. [2022-04-15 13:53:50,577 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 13:53:50,577 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2022-04-15 13:53:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 13:53:50,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:50,578 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 13:53:50,604 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 13:53:50,800 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 13:53:50,801 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 1 times [2022-04-15 13:53:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:50,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326112197] [2022-04-15 13:53:50,802 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:53:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1241120379, now seen corresponding path program 2 times [2022-04-15 13:53:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:53:50,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021915883] [2022-04-15 13:53:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:53:50,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:53:50,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:53:50,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2120476257] [2022-04-15 13:53:50,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:53:50,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:53:50,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:53:50,818 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 13:53:50,839 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 13:53:50,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:53:50,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:53:50,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:53:50,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:50,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:53:51,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {906#true} call ULTIMATE.init(); {906#true} is VALID [2022-04-15 13:53:51,009 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 13:53:51,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 13:53:51,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {906#true} {906#true} #84#return; {906#true} is VALID [2022-04-15 13:53:51,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {906#true} call #t~ret5 := main(); {906#true} is VALID [2022-04-15 13:53:51,013 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 13:53:51,013 INFO L272 TraceCheckUtils]: 6: Hoare triple {906#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {906#true} is VALID [2022-04-15 13:53:51,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 13:53:51,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 13:53:51,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 13:53:51,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {906#true} {906#true} #60#return; {906#true} is VALID [2022-04-15 13:53:51,015 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 13:53:51,016 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 13:53:51,016 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 13:53:51,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 13:53:51,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 13:53:51,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 13:53:51,019 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 13:53:51,019 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 13:53:51,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {906#true} ~cond := #in~cond; {906#true} is VALID [2022-04-15 13:53:51,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {906#true} assume !(0 == ~cond); {906#true} is VALID [2022-04-15 13:53:51,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {906#true} assume true; {906#true} is VALID [2022-04-15 13:53:51,021 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 13:53:51,022 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 13:53:51,022 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 13:53:51,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {985#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {907#false} is VALID [2022-04-15 13:53:51,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#false} assume !false; {907#false} is VALID [2022-04-15 13:53:51,023 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 13:53:51,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:53:51,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:53:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021915883] [2022-04-15 13:53:51,025 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:53:51,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120476257] [2022-04-15 13:53:51,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120476257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:51,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:51,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:51,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:53:51,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326112197] [2022-04-15 13:53:51,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326112197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:51,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:51,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:51,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938713793] [2022-04-15 13:53:51,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:53:51,027 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 13:53:51,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:53:51,028 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 13:53:51,047 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 13:53:51,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:53:51,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:53:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:53:51,049 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 13:53:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:51,439 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2022-04-15 13:53:51,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:53:51,439 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 13:53:51,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:53:51,440 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 13:53:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:51,446 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 13:53:51,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:51,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 13:53:51,514 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 13:53:51,516 INFO L225 Difference]: With dead ends: 58 [2022-04-15 13:53:51,516 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 13:53:51,517 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 13:53:51,517 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 13:53:51,518 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 13:53:51,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 13:53:51,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-04-15 13:53:51,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:53:51,581 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 13:53:51,582 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 13:53:51,582 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 13:53:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:51,586 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 13:53:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 13:53:51,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:51,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:51,587 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 13:53:51,588 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 13:53:51,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:51,591 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2022-04-15 13:53:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-04-15 13:53:51,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:51,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:51,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:53:51,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:53:51,592 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 13:53:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2022-04-15 13:53:51,604 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 27 [2022-04-15 13:53:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:53:51,604 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2022-04-15 13:53:51,605 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 13:53:51,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 67 transitions. [2022-04-15 13:53:51,685 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 13:53:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-04-15 13:53:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 13:53:51,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:51,686 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 13:53:51,702 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 13:53:51,891 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 13:53:51,892 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:51,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:51,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 1 times [2022-04-15 13:53:51,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:51,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832402339] [2022-04-15 13:53:51,893 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:53:51,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1598126198, now seen corresponding path program 2 times [2022-04-15 13:53:51,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:53:51,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118209738] [2022-04-15 13:53:51,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:53:51,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:53:51,908 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 13:53:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056765917] [2022-04-15 13:53:51,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 13:53:51,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:53:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:53:51,920 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 13:53:51,922 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 13:53:51,956 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 13:53:51,956 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 13:53:51,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 13:53:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:53:51,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:53:52,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {1325#true} call ULTIMATE.init(); {1325#true} is VALID [2022-04-15 13:53:52,144 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 13:53:52,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 13:53:52,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1325#true} {1325#true} #84#return; {1325#true} is VALID [2022-04-15 13:53:52,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {1325#true} call #t~ret5 := main(); {1325#true} is VALID [2022-04-15 13:53:52,145 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 13:53:52,145 INFO L272 TraceCheckUtils]: 6: Hoare triple {1325#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1325#true} is VALID [2022-04-15 13:53:52,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 13:53:52,145 INFO L290 TraceCheckUtils]: 8: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 13:53:52,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 13:53:52,146 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1325#true} {1325#true} #60#return; {1325#true} is VALID [2022-04-15 13:53:52,148 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 13:53:52,149 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 13:53:52,149 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 13:53:52,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 13:53:52,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 13:53:52,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 13:53:52,151 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 13:53:52,151 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 13:53:52,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 13:53:52,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 13:53:52,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 13:53:52,160 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 13:53:52,160 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 13:53:52,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {1325#true} ~cond := #in~cond; {1325#true} is VALID [2022-04-15 13:53:52,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {1325#true} assume !(0 == ~cond); {1325#true} is VALID [2022-04-15 13:53:52,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {1325#true} assume true; {1325#true} is VALID [2022-04-15 13:53:52,161 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 13:53:52,162 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 13:53:52,162 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 13:53:52,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {1419#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1326#false} is VALID [2022-04-15 13:53:52,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {1326#false} assume !false; {1326#false} is VALID [2022-04-15 13:53:52,163 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 13:53:52,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 13:53:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:53:52,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118209738] [2022-04-15 13:53:52,164 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 13:53:52,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056765917] [2022-04-15 13:53:52,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056765917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:52,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:52,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:52,165 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:53:52,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832402339] [2022-04-15 13:53:52,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832402339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:53:52,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:53:52,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 13:53:52,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972170374] [2022-04-15 13:53:52,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:53:52,166 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 13:53:52,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:53:52,166 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 13:53:52,187 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 13:53:52,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 13:53:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:52,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 13:53:52,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:53:52,188 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 13:53:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:52,464 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-04-15 13:53:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 13:53:52,464 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 13:53:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:53:52,465 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 13:53:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:52,467 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 13:53:52,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-15 13:53:52,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-15 13:53:52,537 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 13:53:52,539 INFO L225 Difference]: With dead ends: 66 [2022-04-15 13:53:52,539 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 13:53:52,540 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 13:53:52,540 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 13:53:52,541 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 13:53:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 13:53:52,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 13:53:52,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:53:52,561 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 13:53:52,561 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 13:53:52,562 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 13:53:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:52,565 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 13:53:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 13:53:52,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:52,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:52,566 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 13:53:52,566 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 13:53:52,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:53:52,569 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-15 13:53:52,569 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 13:53:52,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:53:52,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:53:52,569 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:53:52,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:53:52,570 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 13:53:52,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-15 13:53:52,572 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 32 [2022-04-15 13:53:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:53:52,573 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-15 13:53:52,573 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 13:53:52,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-15 13:53:52,662 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 13:53:52,662 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-15 13:53:52,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 13:53:52,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:53:52,664 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 13:53:52,691 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 13:53:52,877 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 13:53:52,878 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:53:52,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:53:52,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1002403483, now seen corresponding path program 1 times [2022-04-15 13:53:52,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:53:52,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [673685825]